#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int k=0,viz[100001],u[100001];
vector <int> v[100001];
void dfs(int nod)
{
	viz[nod] = 1;
	for (int i = 0; i < v[nod].size(); i++)
		if (viz[v[nod][i]]==0)
			dfs(v[nod][i]);
    u[++k]=nod;
}

int main()
{
	int n,m,x,y,i;
	f>>n>>m;
	for(i=1;i<=m;i++)
	{
		f>>x>>y;
		v[x].push_back(y);
	}
	for(i=1;i<=n;i++)
		if(viz[i]==0)
			dfs(i);
    for(i=k;i>=1;i--)
        g<<u[i]<<" ";
}