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

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

vector<int> v[50003];

vector<int> ans;

int vis[50003];

void dfs(int nod){
    if(vis[nod]) return;
    vis[nod]=1;
    for(auto i:v[nod]){
        dfs(i);
    }
    ans.push_back(nod);
}

int n, m;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;++i){
        int x, y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;++i){
        dfs(i);
    }
    reverse(ans.begin(), ans.end());
    for(auto i:ans) fout<<i<<" ";
    fout<<"\n";
    return 0;
}