#include <fstream>
#include<vector>
using namespace std;
#define maxn 50005
int n,m,verify[maxn],prim[maxn],g[maxn],s;
vector <int> V[maxn],L;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

void read(){
    int x,y;
    for(int i=1; i<=m; i++){
        cin>>x>>y;
        V[x].push_back(y);
        prim[y]=1;
        g[x]++;
    }
}

void solve(int x){
    if(verify[x]==2||verify[x]==1)
        return;
    verify[x]=1;
    for(int i=0; i<g[x]; i++)
        solve(V[x][i]);
    verify[x]=2;
    L.push_back(x);
}

int main()
{
    cin>>n>>m;
    read();
    for(int i=1; i<=n; i++)
        if(!prim[i])
            solve(i);
    for(int i=n-1; i>=0; i--)
        cout<<L[i]<<' ';
    return 0;
}