#include<fstream>
#include<vector>
#include<queue>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int> v[50005];
queue<int> q;
int p[50005];
bool viz[50005];
int m,n;
void sortaret(int nod){
    q.push(nod);
    for(int j=0; j<v[nod].size();j++)
        p[v[nod][j]]--;
    viz[nod]=true;
    while(!q.empty()){
        int x=q.front();
        g<<x<<" ";
        q.pop();
        for(unsigned i=0;i<v[x].size();i++)
            if(viz[v[x][i]]==false && p[v[x][i]]==0){
                q.push(v[x][i]);
                viz[v[x][i]]=true;
                for(int j=0;j<v[v[x][i]].size();j++)
                    p[v[v[x][i]][j]]--;
            }
    }
}

int main(){
    int i,j,x,y,cod;
    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y;
        cod=1;
        for(j=1;j<v[x].size();j++)
            if(v[x][j]==y)
            cod=0;
        if(cod==1){
            v[x].push_back(y);
            p[y]++;
        }
    }
    /*cod=1;
    int cod1=1;
    while(cod!=0 && cod1!=0){
        for(i=1;i<=n;i++)
            if(p[i]==0 && viz[i]==0){
                cout<<i<<" ";
                for(j=1;j<=s[i][0];j++)
                    p[s[i][j]]--;
                viz[i]=1;
            }
        cod=0;
        cod1=0;
        for(i=1;i<=n;i++){
            if(p[i]!=0)
                cod++;
            if(p[i]==0 && viz[i]==0)
                cod1++;
        }
    }*/
    for(i=1;i<=n;i++)
        if(p[i]==0){
            sortaret(i);
            return 0;
        }
}