//#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <functional>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<int> G[100003];
int n, m, x, y;
int in[50003];
queue <int> q;
int main()
{
    cin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int x, y;
        cin>>x>>y;
        G[x].push_back(y);
        in[y]++;
    }
    for (int i=1; i<=n; i++)
        if (in[i]==0)
            q.push(i);
    while (q.size())
    {
        int x=q.front();
        q.pop();
        cout<<x<<' ';
        for (auto y : G[x])
        {
            in[y]--;
            if (in[y]==0)
                q.push(y);
        }
    }
    return 0;
}