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

using namespace std;


const int MAX = 100100;

int n, m;
vector<int> g[MAX];

int soln[MAX];


void read() {
	ifstream fin("sortaret.in");
	fin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		int x, y;
		fin >> x >> y;
		g[x].push_back(y);
	}
}


bool vis[MAX];

inline void sortop(const int &node) {
	vis[node] = true;
	for (auto i: g[node]) {
		if (!vis[i])
			sortop(i);
	}
	soln[++soln[0]] = node;
}


inline void write() {
	ofstream fout("sortaret.out");
	for (int i = soln[0]; i >= 1; --i)
		fout << soln[i] << ' ';
}


int main() {
	read();
	for (int i = 1; i <= n; ++i)
		if (!vis[i])
			sortop(i);
	write();
}