#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <set>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
vector<int> nod[50001];
vector<int> urm[50001];
bitset<50001> f;

void readAndSet() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        nod[a].push_back(b);
        urm[b].push_back(a);
    }
}

void solve(int i) {
    f[i] = true;
    for (int j : urm[i]) /// mergem in sus pe graf si afisam toate nodurile tata mai intai
        if (!f[j])
            solve(j);
    fout << i << ' ';
}

int cautaNoduri() {
    for (int i = 1; i <= n; i++)
        if (!f[i]) /// daca nu am afisat deja nodul
            solve(i);
}

int main() {
    readAndSet();
    cautaNoduri();
    return 0;
}