#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

const int kNmax = 100005, ALB = 0, GRI = 1, NEGRU = 2;

class Task {
 public:
	void solve() {
		read_input();
		print_output(get_result());
	}

 private:
	int n;
	int m;
	vector<int> adj[kNmax];
    vector<int> c;
	void read_input() {
		ifstream fin("sortaret.in");
		fin >> n >> m;
		for (int i = 1, x, y; i <= m; i++) {
			fin >> x >> y;
			adj[x].push_back(y);
		}
		fin.close();
	}
	void dfs(int u, vector<int> &topsort) {
        c[u] = GRI;
        for(unsigned i = 0; i < adj[u].size(); ++i) {
            int v = adj[u][i];
            if(c[v] == ALB) {
                dfs(v, topsort);
            }
        }
        c[u] = NEGRU;
        topsort.push_back(u);
	}
    void sortaret(vector<int> &topsort) {
        c.resize(n + 1, ALB);
        for(int i = 1; i <= n; ++i) {
            if(c[i] == ALB) {
                dfs(i, topsort);
            }
        }
    }
	vector<int> get_result() {
		/*
		TODO: Faceti sortarea topologica a grafului stocat cu liste de
		adiacenta in adj.
		*******
		ATENTIE: nodurile sunt indexate de la 1 la n.
		*******
		*/
		vector<int> topsort;
		sortaret(topsort);
        reverse(topsort.begin(), topsort.end());
		return topsort;
	}

	void print_output(vector<int> result) {
		ofstream fout("sortaret.out");
		for (int i = 0; i < int(result.size()); i++) {
			fout << result[i] << ' ';
		}
		fout << '\n';
		fout.close();
	}
};

int main() {
	Task *task = new Task();
	task->solve();
	delete task;
	return 0;
}