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

using namespace std;

vector<int> ans;
vector<int> L[50100];
bool viz[50100];
int c[50100];

void df(int node) {
    viz[node] = true;
    for(int i = 0; i < L[node].size(); i ++) {
        int cur = L[node][i];
        if(!viz[cur]) df(cur);
    }
    ans.push_back(node);
}

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]) df(i);

    for(int i = ans.size() - 1; i >= 0; i --) g << ans[i] << " ";

    g << "\n";
    return 0;
}