#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n, m, grad[50001];
vector <int> G[50001];
queue <int> Q;
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a, b;
        fin>>a>>b;
        G[a].push_back(b);
        grad[b]++;
    }
    for(int i=1; i<=n; ++i)
        if(grad[i]==0)
            Q.push(i);
    while(!Q.empty())
    {
        int nod=Q.front();
        Q.pop();
        fout<<nod<<' ';
        for(unsigned i=0; i<G[nod].size(); ++i)
        {
            grad[G[nod][i]]--;
            if(grad[G[nod][i]]==0)
                Q.push(G[nod][i]);
        }

    }
    return 0;
}