#include <fstream>
#include <deque>
#include <vector>
using namespace std;
#define N 50001
vector <int> f[N];
deque <int> q;

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n,m,i,j,a,b,v[N];
    in>>n>>m;
    while(m--)
    {
        in>>a>>b;
        v[b]++;
        f[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        if(v[i]==0)
            q.push_back(i);
    while(q.size())
    {
        a=q.front();
        out<<a<<" ";
        for(int i=0;i<f[a].size();i++)
        {
            v[f[a][i]]--;
            if(v[f[a][i]]==0)
                q.push_back(f[a][i]);
        }
        q.pop_front();
    }
    out<<"\n";
    return 0;
}