#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define MAX 50000

using namespace std;

int vect[MAX];
vector<int> v;

int main(){
	ifstream fin("sortaret.in");
	ofstream fout("sortaret.out");

	int n, m, x, y;
	vector<vector<int>> adiacenta;
	queue<int> q;
	vect[0] = -1;

	fin >> n >> m;

	for(int i = 0; i <= n; i++){
		adiacenta.push_back(v);
	}
	
	for(int i = 0; i < m; i++){
		fin >> x >> y;
		vect[y]++;
		adiacenta[x].push_back(y);
	}

	for(int i = 1; i <= n; i++){
		if(vect[i] == 0)
			q.push(i);
	}
	while(q.size()){	
		int x = q.front();
		q.pop();
		fout << x << " ";
 		for(int i = 0; i < adiacenta[x].size(); i++){
			vect[adiacenta[x][i]]--;
			if(vect[adiacenta[x][i]] == 0)
				q.push(adiacenta[x][i]);
		}
	}
	return 0;
}