#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N = 50010;
vector<int> v[N];
int n,m,s[N],gi[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
        gi[y]++;
    }
    int k=0;
    for(int i=1;i<=n;i++)
        if(gi[i]==0)
            q.push(i);
    while(q.size())
    {
        int nod=q.front();q.pop();
        s[++k]=nod;
        for(auto vec:v[nod])
        {
            gi[vec]--;
            if(gi[vec]==0)
            {

                q.push(vec);
            }
        }
    }
    for(int i=1;i<=n;i++)
        g<<s[i]<<' ';
    return 0;
}