#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define maxn 100100
int n, m;
int cint[maxn];
vector<int> v[maxn];
queue<int> q;
int added[maxn];
int viz[maxn];
int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    int x, y;
    for (int i = 1; i <= m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        cint[y]++;
    }
    for (int i = 1; i <= n; i++)
        if(cint[i] == 0) q.push(i);
    while(!q.empty())
    {
        g<<q.front()<<' ';
        for (int i = 0; i < v[q.front()].size(); i++)
        {
            cint[v[q.front()][i]]--;
            if (cint[v[q.front()][i]] == 0) q.push(v[q.front()][i]);
        }
        q.pop();
    }
}