#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;

void sorttop(int n, vector<vector<int>>&adj, vector<int>&dg, vector<int>&result)
{
    queue<int>q;
    for(int i = 1; i <= n; i++)
    {
        if(dg[i] == 0)
            q.push(i);
    }

    while(!q.empty())
    {
        int f = q.front();
        q.pop();
        result.push_back(f);

        for(auto a : adj[f])
        {
            dg[a]--;
            if(dg[a] == 0)
                q.push(a);
        }
    }

}
int main()
{
    fin >> n >> m;
    vector<vector<int>>adj(n+1);
    vector<int>dg(n+1);
    for(int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
        dg[y]++;
    }

    vector<int>result;

    sorttop(n, adj, dg, result);

    for(int i = 0; i < n; i++)
        fout << result[i] << " ";

    return 0;
}