#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

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

int n, m;
int deg[50005];
vector<int> Gin[50005];
vector<int> Gout[50005];
vector<int> sol;
queue<int> q;

int main()
{
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        Gout[x].push_back(y);
        Gin[y].push_back(x);
        deg[x]++;
    }
    for(int i = 1; i <= n; i++)
        if(deg[i] == 0)
            q.push(i);
    while(!q.empty())
    {
        int current = q.front();
        q.pop();
        sol.push_back(current);
        for(int x : Gin[current])
        {
            deg[x]--;
            if(deg[x] == 0)
                q.push(x);
        }
    }
    reverse(sol.begin(), sol.end());
    for(int x : sol)
        out << x << ' ';
    return 0;
}