#include <fstream>
#include <algorithm>
#include <vector>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,x,y;
vector<int>v[nmax],tsort;
bool viz[nmax];
void dfs(int nod){
    viz[nod]=1;
    for(auto i:v[nod])
        if(!viz[i])
            dfs(i);
    tsort.push_back(nod);
}
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    reverse(tsort.begin(),tsort.end());
    for(auto i:tsort)
        cout<<i<<" ";
    return 0;
}