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


const int kNmax = 100005;

int main(){
    int n;
	int m;
    int x,y;
	int source;
	vector<int> adj[kNmax];
    vector<int> grad;
    grad.push_back(-1);
    ifstream fin("sortaret.in");
		fin >> n >> m;
        for(int i = 1; i <= n; i++) {
            grad.push_back(0);
        }
		for (int i = 1; i <= m; i++) {
			fin >> x >> y;
			adj[x].push_back(y);
            grad[y]++;
		}
	fin.close();
    queue<int> q;
    for(int i = 1; i <= n; i++) {
        if(grad[i] == 0) {
            q.push(i);
        }
    }
    vector<int> solutie;
    while(!q.empty()) {
        int node = q.front();
        q.pop();
        solutie.push_back(node);
        for(int neighbor : adj[node]) {
            grad[neighbor] --;
            if(grad[neighbor] == 0) {
                q.push(neighbor);
            }
        }
    }
    ofstream fout("sortaret.out");
    for(int i = 0; i < solutie.size(); i++) {
        fout<<solutie[i]<<" ";
    }
    fout.close();
}