#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n, m, x, y;
vector<int> final_list;
pair<vector<int>, int> mygraph[50005];
queue<int> myqueue;

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin >> n >> m;
    for (int i = 0; i < m; i ++)
    {
        cin >> x >> y;
        mygraph[x].first.push_back(y);
        mygraph[y].second ++;
    }
    for (int i = 1; i <= n; i ++)
        if (!mygraph[i].second)
            myqueue.push(i);
    while(!myqueue.empty())
    {
        int nod = myqueue.front();
        final_list.push_back(nod);
        for (int i = 0; i < mygraph[nod].first.size(); i ++)
        {
            mygraph[mygraph[nod].first[i]].second --;
            if (!mygraph[mygraph[nod].first[i]].second)
                myqueue.push(mygraph[nod].first[i]);
        }
        mygraph[nod].first.clear();
        myqueue.pop();
    }
    for (int i = 0; i < final_list.size(); i ++)
        cout << final_list[i] << " ";
    return 0;
}