#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int Nmax=50010;
vector<int>G[Nmax];
queue<int>Q;
vector<int>::iterator it;
int grad[Nmax];
int main()
{
    int n,m,i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
        grad[y]++;
    }
    for(i=1;i<=n;i++)
    {
        if(grad[i]==0) Q.push(i);
    }
    while(Q.size())
    {
        int nod=Q.front();
        fout<<nod<<" ";
        Q.pop();
        for(it=G[nod].begin();it!=G[nod].end();it++)
        {
            grad[*it]--;
            if(grad[*it]==0) Q.push(*it);
        }
    }
}