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

int n,m,i,x,y,viz[50002],nod;
vector <int> G[50002],Gt[50002];
queue <int> q;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        Gt[y].push_back(x);
    }

    for(i=1;i<=n;i++)
    {
        if(Gt[i].size()==0)
        {
            q.push(i);
            viz[i]=1;
        }
    }

    while(!q.empty())
    {
        nod=q.front();
        fout<<nod<<" ";
        q.pop();
        for(vector<int>::iterator it=G[nod].begin();it<G[nod].end();it++)
        {
            if(viz[*it]==0)
            {
                viz[*it]=1;
                q.push(*it);
            }
        }
    }

    fin.close();
    fout.close();
    return 0;
}