#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

#define MMAX 50001
#define NMAX 100001

std::ifstream f("sortaret.in");
std::ofstream g("sortaret.out");

int n, m, k;
std::vector<int> graph[MMAX];
std::vector<int> sol;
bool seen[NMAX];

void read(){
	
	int x, y;
	
	f >> n >> m;
	
	for (int i = 0; i < m; i++){
		f >> x >> y;
		graph[x].push_back(y);
	}
	
	f.close();
}

void solve(int node){
	seen[node] = 1;
	
	for (int i = 0; i < (int) graph[node].size(); i++){
		if (seen[graph[node][i]] == 0)
			solve(graph[node][i]);
	}
	
	sol.push_back(node);
}

void write(){

	for (int i = n - 1; i >= 0; i--){
		g << sol[i] << " ";
	}
	g << "\n";
	
	g.close();
}

int main()
{

	read();
	
	for (int i = 1; i <= n; i++)
		if (seen[i] == 0){
			solve(i);
		}
			
	write();

    return 0;
}