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

using namespace std;
ofstream out("sortaret.out");


int main()
{
    ifstream in("sortaret.in");

    int n, m;

    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;
        ++dp[y];
        g[x].push_back(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 nod = q.front();
        q.pop();

        sol.push_back(nod);

        for(vector<int>:: iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        {
            --dp[*it];

            if(dp[*it] == 0)
            {
                q.push(*it);
            }
        }
    }

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

    return 0;
}