#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define MAXN 50005
int n,m;
vector<int> G[MAXN],sol;
bool used[MAXN];

void dfs(int node){
    used[node]=1;
    for(auto p : G[node])
        if(!used[p])
            dfs(p);
    sol.push_back(node);
}

int main()
{
    int x,y,i;
    fin>>n>>m;
    while(m--){
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(!used[i])
            dfs(i);
    for(i=sol.size()-1;i>=0;i--)
        fout<<sol[i]<<" ";
	return 0;
}