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

using namespace std;

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

int n, m;
int nrA[50005];
vector<vector<int>> adj;

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

    while(!q.empty())
    {
        int node = q.front();
        q.pop();
        out << node << ' ';

        for(auto it: adj[node])
        {
            nrA[it]--;
            if(nrA[it] == 0)
                q.push(it);
        }
    }
}

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

    topSort();

    out << '\n';

    return 0;
}