#include <bits/stdc++.h>
using namespace std;

const int nm=1e5+5;

int grad[nm], rez[nm];

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n, m, a, b, pz=0;
    cin>>n>>m;
    vector<vector<int>> v;
    v.resize(n+2);
    for(int i=1; i<=m; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
        grad[b]++;
    }
    queue<int> q;
    for(int i=1; i<=n; i++)
    {
        if(grad[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        int x=q.front();
        rez[++pz]=x;
        q.pop();
        for(auto i:v[x])
        {
            grad[i]--;
            if(grad[i]==0)
                q.push(i);
        }
    }
    for(int i=1; i<=n; i++)
        cout<<rez[i]<<" ";
    return 0;
}