#include <bits/stdc++.h>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m, top;
vector<int>ad[50005];
int st[50005], vis[50005];

void dfs(int x){
    vis[x]=1;
    for(auto w : ad[x])
        if(vis[w]==0)
            dfs(w);
    st[++top]=x;
}

int main(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        int a, b;
        fin>>a>>b;
        ad[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(!vis[i])
            dfs(i);
    for(int i=n;i>=1;i--)
        fout<<st[i]<<" ";
    return 0;
}