#include <fstream>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;

class Graph {
	public:
		Graph(int N) : edges(N), inDegree(N) {}

		void addEdge(int x, int y) {
			edges[x].push_back(y);
			inDegree[y] ++;
		}

		vector<int> sort() {
			queue<int> Q;
			vector<int> result;

			for (int i=0; i<inDegree.size(); ++i) {
				if (inDegree[i] == 0) {
					Q.push(i);
				}
			}

			while (!Q.empty()) {
				int x = Q.front();
				Q.pop();
				result.push_back(x);
				for (list<int>::iterator it = edges[x].begin(); 
					 it != edges[x].end();
					 ++ it) {
					inDegree[*it] --;
					if (inDegree[*it] == 0) {
						Q.push(*it);
					}
				}
			}

			return result;
		}
	private:
		vector< list<int> > edges;
		vector< int > inDegree;
};

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

	int N, M;

	in >> N >> M;
	Graph g(N);
	while (M--) {
		int x, y;
		in >> x >> y;
		g.addEdge(x-1, y-1);
	}

	vector<int> sorted = g.sort();
	for (int i=0; i<sorted.size(); ++i)
		out << sorted[i] + 1 << " ";
	out << "\n";
	return 0;
}