#include <bits/stdc++.h>

using namespace std;

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

vector<int>v[50005];
queue<int>q;
int a[50005],top,n,m;

int grad[50005];
int main()
{
    int x,y;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;i++)
        if(grad[i]==0)q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        a[++top]=x;
        for(int i=0;i<v[x].size();i++)
        {
            grad[v[x][i]]--;
            if(grad[v[x][i]]==0) q.push(v[x][i]);
        }
    }
    for(int i=1;i<=n;i++)
        fout<<a[i]<<" ";
    fout<<"\n";

    return 0;
}