#include <bits/stdc++.h>

using namespace std;
ifstream in ("sortaret.in");
ofstream out ("sortaret.out");
const int NMAX=50005;
int n,m;
int x,y;
vector <int> v[NMAX];
int tata[NMAX];
queue <int> q;
void topsort()
{
    for(int i=1;i<=n;i++)
    {
        if(!tata[i])
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        out<<nod<<" ";
        for(auto i:v[nod])
        {
            tata[i]--;
            if(!tata[i])
            {
                q.push(i);
            }
        }
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        tata[y]++;
    }
    topsort();
    return 0;
}