#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out"); 
vector<int> muchii[50001];
int visited[50001];
int sol[50001];
int mch;
void DFS(int i) {
    visited[i] = 1;
    // nodul i a fost deja vizitat
    for(auto node : muchii[i]) {
        // parcurgem toate combinatiile in care nodul i 
        // apare pe prima pozitie
        if(!visited[node])
            DFS(node);
    }
    sol[++mch] = i;

}
int main() {
    int m, n, a, b;
    fin >> n>> m;
    for(int i = 1; i <= m; i++) {
        fin>> a>> b;
        muchii[a].push_back(b); // adaugam dupa a elementul b
    } 
    for(int i = 1; i <= n; i++) {
        if(!visited[i]) {
            DFS(i);
        }
    }
    for(int i = mch; i >= 1; i--) {
        fout << sol[i] << " ";
    }
    return 0;


}