#include<cstdio>
#include<queue>
#include<vector>
#define _NMAX 50010
using namespace std;
typedef vector<int>::iterator v_it;

vector<int> lAd_out[_NMAX],lAd_in[_NMAX];
int nN, nM;
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&nN,&nM);
    for (int i=1;i<=nM;i++)
    {
        int nod1,nod2;
        scanf("%d%d",&nod1,&nod2);
        lAd_out[nod1].push_back(nod2);
        lAd_in[nod2].push_back(nod1);
    }
    vector<int> sol;
    queue<int> q;
    for (int i=1;i<=nN;i++) if(lAd_in[i].empty()) q.push(i);
    static int in_rem[_NMAX];
    while (!q.empty())
    {
        int cur=q.front(); q.pop();
        sol.push_back(cur);
        for (v_it it=lAd_out[cur].begin();it!=lAd_out[cur].end();++it)
        {
            in_rem[*it]++;
            if (in_rem[*it]==lAd_in[*it].size()) q.push(*it);
        }
    }
    for (int i=0;i<sol.size();i++) printf("%d ", sol.at(i));
    return 0;
}