#include <bits/stdc++.h>

using namespace std;

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

vector<vector<int>> e;
vector<int> order,in;

int main()
{
    int n,m;
    fin >> n >> m;
    e.resize(n+1);
    in.resize(n+1);
    for(int i = 1; i<=m; i++)
    {
        int x, y;
        fin >> x >> y;
        e[x].push_back(y);
        in[y]++;
    }

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

    while(!q.empty())
    {
        int node = q.front();
        order.push_back(node);
        q.pop();
        for(auto adj : e[node])
        {
            in[adj] --;
            if(in[adj] == 0)
                q.push(adj);
        }
    }
    for(auto i : order)
        fout << i << " ";
    return 0;
}