#include<fstream>
#include<queue>
#include<vector>
#define dim 50008

using namespace std;


ifstream f("sortaret.in");
ofstream g("sortaret.out");
int  i,n,x,y,vecin,m,grad[dim],s[dim];
vector< int >G[dim];

void top () {

    int i;
    for(i=1;i<=n;++i){
        if(grad[i]==0)
           s[++s[0]]=i;
    }

    for(i=1;i<=n;++i){
        x=s[i];
        for(int j=0;j<G[x].size();++j){

            vecin=G[x][j];
            --grad[vecin];
            if(!grad[vecin])
                s[++s[0]]=vecin;
        }
    }
    for(i=1;i<=n;++i){
        g<<s[i]<<" ";
    }

}
int main () {
    f>>n>>m;

    for(i=1;i<=m;++i){
        f>>x>>y;
        G[x].push_back(y);
        grad[y]++;
    }
    top();

    return 0;
}