#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,x,y,cnt[50001];
vector<int>v[100001];
queue<int>q;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y;
        v[x].push_back(y);
        cnt[y]++;
    }

    for(int i=1;i<=n;i++)
        if(cnt[i]==0)
            q.push(i);

    while(!q.empty()){
        int k=q.front();
        fout<<k<<" ";
        for(auto i:v[k]){
            cnt[i]--;
            if(cnt[i]==0)
                q.push(i);
        }
        q.pop();
    }

    return 0;
}