#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(){
    for(int i=1;i<=n;i++)
        if(p[i]==0){
            q.push(i);
            viz[i]=true;
        }
    while(!q.empty()){
        int x=q.front();
        g<<x<<" ";
        for(unsigned i=0;i<v[x].size();i++)
            p[v[x][i]]--;
        q.pop();
        for(unsigned i=0;i<v[x].size();i++)
            if(viz[v[x][i]]==false && p[v[x][i]]==0){
                int nod=v[x][i];
                q.push(nod);
                viz[nod]=true;
            }
    }
}

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]++;
        }
    }
    sortaret();
    return 0;
}