#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int gr[50002];
vector <int> v[50002];
queue <int> q;
int main()
{
    int n,m,i,x,y;
    f>>n>>m;
    while(m--)
    {
        f>>x>>y;
        gr[y]++;v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(!gr[i])
            q.push(i);
    while(!q.empty())
    {
        x=q.front();q.pop();g<<x<<" ";
        for(vector<int> :: iterator it=v[x].begin();it!=v[x].end();it++)
        {
            gr[*it]--;
            if(gr[*it]==0)
                q.push(*it);
        }
    }
}