#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <cstring>

using namespace std;

//#include <iostream>
#include <fstream>

//ifstream cin ("input.in");
//ofstream cout ("output.out");

ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");

static const int NMAX = 50005;

int f[NMAX];
vector <int> graph[NMAX];
vector <int> sol;

void dfs(int node) {
	f[node] = 1;

	for ( auto x:graph[node] ) {
		if ( !f[x] ) {
			dfs(x);
		}
	}

	sol.push_back(node);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	int n, m;
	cin>>n>>m;
	for ( int i = 1; i <= m; ++i ) {
		int x, y;
		cin>>x>>y;
		graph[x].push_back(y);
	}

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

	for ( int i = sol.size()-1; i >= 0; --i ) {
		cout<<sol[i]<<" ";
	}
}