#include <stdio.h>
#include <vector>
#include <list>
#include <stack>
#define pb push_back
using namespace std;

int n, m;
vector< list<int> > vecini;
vector<bool> grad;
vector<bool> terminat;
stack<int> st;

void read();
void solve();
void write();
void dfs(int);

int main()
{
	read();
	solve();
	write();
	return 0;
}

void dfs(int p)
{
	list<int>::iterator i, sfarsit = vecini[p].end();
	for (i = vecini[p].begin(); i != sfarsit; ++i)
	{
		if (!terminat[*i])
		{
			dfs(*i);
		}
	}
	terminat[p] = 1;
	st.push(p);
}

void solve()
{
	int i;
	for (i = 1; i <= n; ++i)
	{
		if (!grad[i])
		{
			dfs(i);
		}
	}
}

void write()
{
	FILE *fout = fopen("sortaret.out", "w");
	while (!st.empty())
	{
		fprintf(fout, "%d ", st.top());
		st.pop();
	}
	fclose(fout);
}

void read()
{
	int i, x, y;
	FILE *fin = fopen("sortaret.in", "r");
	fscanf(fin, "%d%d", &n, &m);
	vecini.resize(n + 1);
	grad.resize(n + 1, 0);
	for (i = 1; i <= m; ++i)
	{
		fscanf(fin, "%d%d", &x, &y);
		vecini[x].pb(y);
		grad[y] = 1;
	}
	fclose(fin);
	terminat.resize(n + 1, 0);
}