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

using namespace std;
ifstream in("sortaret.in");

int n,m;
int main()
{
    ofstream out("sortaret.out");

    in >> n >> m;
    vector<vector<int> >g(n + 2, vector<int>());
    vector<int> dp(n + 2, 0);


    for(int i = 1; i<=m; ++i)
    {
        int x,y;
        in >> x >> y;
        g[x].push_back(y);
        ++dp[y];
    }

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

    vector<int> sol;

    while(q.size())
    {
        int node = q.front();
        q.pop();

        sol.push_back(node);
        for(vector<int>:: iterator it = g[node].begin(); it != g[node].end(); ++it)
        {
            --dp[*it];
            if(dp[*it] == 0)
                q.push(*it);
        }
    }

    for(int i = 0; i < sol.size(); ++i)
        out << sol[i] << " ";

    return 0;
}