// Include
#include <fstream>
#include <vector>
using namespace std;

// Definitii
#define pb push_back

// Constante
const int sz = (int)5e4+1;

// Functii
void dfs(int node);

// Variabile
ifstream in("sortaret.in");
ofstream out("sortaret.out");

int nodes, edges;
int visited[sz];

vector<int> before[sz], after[sz];

// Main
int main()
{
	in >> nodes >> edges;
	
	int rFrom, rTo;
	while(edges--)
	{
		in >> rFrom >> rTo;
		
		before[rTo].pb(rFrom);
		after[rFrom].pb(rTo);
	}
	
	for(int i=1 ; i<=nodes ; ++i)
		dfs(i);
	
	out << '\n';
	
	in.close();
	out.close();
	return 0;
}

void dfs(int node)
{
	if(visited[node])
		return;
	
	vector<int>::iterator it, end=before[node].end();
	for(it=before[node].begin() ; it!=end ; ++it)
		dfs(*it);
	
	out << node << ' ';
	visited[node] = true;
	
	end = after[node].end();
	for(it=after[node].begin() ; it!=end ; ++it)
		dfs(*it);
}