#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m, grad[50001];
vector <int> v[50001];
queue <int> q;

int main()
{
    fin >> n >> m;

    for(int i = 1; i <= m; i++)
    {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
        grad[b]++;

    }
    for(int i = 1; i <= n; i++)
        if(grad[i] == 0)
            q.push(i);
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        fout << x << " ";
        for(int i = 0; i < v[x].size(); i++)
        {
            int y = v[x][i];
            grad[y]--;
            if(grad[y] == 0)
                q.push(y);
        }

    }


    return 0;
}