#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int grad[100005],sol[100005],rez,nod,n,m,x,y;
vector <int> muchii_intrare[100005],muchii_iesire[100005];
queue <int> q;

int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        muchii_iesire[x].push_back(y);
        muchii_intrare[y].push_back(x);
        grad[x]++;
    }
    for(int i=1;i<=n;i++){
        if(grad[i]==0)
            q.push(i);
    }
    while(!q.empty()){
        nod=q.front();
        sol[rez++]=nod;
        for(int i=0;i<muchii_intrare[nod].size();i++){
            grad[muchii_intrare[nod][i]]--;
            if(grad[muchii_intrare[nod][i]]==0)
                q.push(muchii_intrare[nod][i]);
        }
        q.pop();
    }
    for(int i=0;i<rez;i++){
        cout<<sol[i]<<" ";
    }

    return 0;
}