#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <vector>
#define NMax 50001
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n, m, in[NMax], q[NMax], x, y;
vector<int> G[NMax];

void TopSort()
{
    vector<int>::iterator it;

    for(int i = 1; i <= n; ++i)
     if(in[i] == 0) q[++q[0]] = i;

    for(int i = 1; i <= n; i++)
    {
        for(it = G[q[i]].begin(); it != G[q[i]].end(); ++it)
        {
            in[*it]--;
            if(in[*it] == 0) q[++q[0]] = *it;
        }
    }
    for(int i = 1; i <= n; ++i)
        g << q[i] << " ";
}

int main(void)
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        G[x].push_back(y);
        in[y]++;
    }
    TopSort();
    return 0;
}