#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
vector<int>rez;
vector<int>a[50001];
bitset<50001>viz;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
void dfs(int x){
    viz[x]=1;
    for (auto y:a[x]){
        if (!viz[y]){
            dfs(y);
        }
    }
    rez.push_back(x);
}
int main(){
    int n,m;
    in>>n>>m;
    for(int i=0; i<m; i++){
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1; i<=n; i++){
        if(!viz[i]){
            dfs(i);
        }
    }
    n--;
    while(n>=0){
        out<<rez[n--]<<" ";
    }
    return 0;
}