#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
void read();
vector<int> v[50005];
int n, m, d[50005];
int main()
{
    read();
    queue<int> q;
    for(int i=1; i<=n; i++)
        if(d[i] == 0)
            q.push(i);
    while(!q.empty())
    {
        int cur = q.front();
        fout << cur << ' ';
        q.pop();
        for(int i=0; i<v[cur].size(); i++)
        {
            d[v[cur][i]]--;
            if(d[v[cur][i]] == 0)
                q.push(v[cur][i]);
        }
    }
    return 0;
}
void read()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        d[y]++;
    }
}