#include <fstream>
#include <vector>
#define maxn 50010
#define maxm 100010
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,deg[maxn],Q[maxn];
vector<int> v[maxn+5];
void solve()
{
    for(int i=1;i<=n;i++)
        if(!deg[i])
            Q[++Q[0]]=i;
    for(int i=1;i<=n;i++)
        for(int j=0;j<v[Q[i]].size();j++)
        {
            --deg[v[Q[i]][j]];
            if(!deg[v[Q[i]][j]])
                Q[++Q[0]]=v[Q[i]][j];
        }
}
int main()
{
    int x,y;
    fin>>n>>m;
    while(fin>>x>>y)
        v[x].push_back(y),deg[y]++;
    solve();
    for(int i=1;i<=n;i++)
        fout<<Q[i]<<" ";
    return 0;
}