#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <vector<int>>v;
int b[50001];
void f(int i)
{
    queue <int> Q;
    Q.push(i);
    if (b[i]==0) {fout << i <<" ";b[i]=-1;}
    while (!Q.empty())
    {
        i=Q.front();
        Q.pop();
        for (int j=0;j<v[i].size();j++)
        {
            if (b[v[i][j]]>0)
            {
                b[v[i][j]]--;
                if (b[v[i][j]]==0) {fout << v[i][j] <<" ";b[v[i][j]]=-1;}
                Q.push(v[i][j]);
            }
        }
    }
}
int main()
{
    int n,m;
    fin >>n>>m;
    v.resize(50001);
    for (int i=1; i<=m; i++)
    {
        int x,y;
        fin >>x>>y;
        v[x].push_back(y);
        b[y]++;
    }
    for (int i=1;i<=n;i++) if (b[i]!=-1)f(i);
}