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

using namespace std;

queue<int> Q;
vector<int> ans;
vector<int> L[50100];
int c[50100];

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");

    int n, m, x, y;
    f >> n >> m;
    for(int i = 1; i <= m; i ++) {
        f >> x >> y;
        c[y] ++;
        L[x].push_back(y);
    }
    for(int i = 1; i <= n; i ++) if(!c[i]) Q.push(i), c[i] = -1;

    while(!Q.empty()) {
        int cur = Q.front(); Q.pop();
        for(int i = 0; i < L[cur].size(); i ++) {
            c[L[cur][i]] --;
        }
        ans.push_back(cur);
        for(int i = 1; i <= n; i ++)
            if(c[i] == 0) Q.push(i), c[i] = -1;
    }
    for(int i = 0; i < ans.size(); i ++) g << ans[i] << " ";
    g << "\n";
    return 0;
}