#include <cstdio>
#include <vector>
#include <stack>
#define NMAX 50005
using namespace std;

int N, M;
bool viz[NMAX];
vector<int> G[NMAX], st;
//stack<int> st;

void read(void)
{
	int x, y;
	FILE *f = fopen("sortaret.in", "r");
		
	fscanf(f, "%d%d", &N, &M);	
	for(int i = 0; i < M ; ++i)	
		fscanf(f, "%d%d", &x, &y),
		G[x].push_back(y);
		
	fclose(f);
}

void DFS(int nod)
{
	viz[nod] = 1;
	for(int i = 0; i < G[nod].size(); ++i)
		if(!viz[G[nod][i]])
			st.push_back(G[nod][i]), DFS(G[nod][i]);
		
	//st.push(nod);
}

void solve(void)
{
	for(int i = 1; i <= N; ++i)
		if(!viz[i])
			st.push_back(i), DFS(i);
}

void print(void)
{
	FILE *g = fopen("sortaret.out", "w");
		
	//for( ;!st.empty(); fprintf(g, "%d ", st.top()), st.pop());
	for(int i = 0; i < st.size(); ++i)
		fprintf(g, "%d ", st[i]);
	fclose(g);
}

int main(void)
{
	read();
	solve();
	print();
	
	return 0;
}