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

using namespace std;

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

const int N=5e4+2;

int n,m,x,y;
int nrp[N];
vector<int>v[N];
queue<int>q;

int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
        nrp[y]++;
    }
    for(int i=1;i<=n;i++)
    {
        if(nrp[i]==0)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        cout<<nod<<" ";
        for(size_t i=0;i<v[nod].size();i++)
        {
            int el=v[nod][i];
            nrp[el]--;
            if(nrp[el]==0)
            {
                q.push(el);
            }
        }
    }
    return 0;
}