#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
//graf
vector< vector<int> > g;
//sorted list
vector<int> a;
//visited
vector<bool> v;

void visit(int k) {
    if (!v[k]) {
        v[k] = true;
        for (int i = 0; i < g[k].size(); i++) {
            visit(g[k][i]);
        }
        a.push_back(k);
    }
}

int main() {
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");

    cin>>n>>m;
    g.resize(n+1);
    v.resize(n+1);
    fill(v.begin(), v.end(), false);
    for (int i = 0; i < m; i++) {
        int x, y;
        cin>>x>>y;
        g[x].push_back(y);
    }
    for (int i = 1; i <= n; i++) {
        visit(i);
    }
    reverse(a.begin(), a.end());
    for (int i = 0; i < a.size(); i++) {
        cout<<a[i]<<" ";
    }
    return 0;
}