#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define NMAX 50001
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int N, M;
vector<int> graph[NMAX];
vector<int> degree(NMAX,0);
vector<int> q;

void solve()
{
    vector<int>::iterator it;
    int i, x;
    for(i=1; i<=N; i++)
        if(degree[i] == 0)
            q.push_back(i);

    for(i=0; i<N; i++)
    {
        x = q[i];

        for(it = graph[x].begin(); it!=graph[x].end(); ++it)
        {
            degree[*it]--;
            if(degree[*it] == 0)
                q.push_back(*it);

        }
    }


}
int main()
{

    int i;
    int a, b;
    fin >> N >> M;
    for(i=1; i<=M; i++)

    {
        fin >> a>> b;
        graph[a].push_back(b);
        degree[b]++;
    }

    solve();

   for(int i=0; i<N; i++)
    fout <<q[i] << " ";

    cout << "Hello world!" << endl;
    return 0;
}