#include <iostream>
#include <fstream>
#include <queue>
#include<vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> L[1000001];
int grad[1000001];
int main() {
    int n,m,x,y;
    fin>>n>>m;
    for (int i=1;i<=m;i++) {
        fin>>x>>y;
        grad[y]++;
        L[x].push_back(y);
    }
    queue<int> Q;
    for (int i=1;i<=n;i++) {
        if (grad[i] == 0) {
            Q.push(i);
        }
    }
    while (!Q.empty()) {
        int z = Q.front();
        Q.pop();
        fout<<z;
        for (auto vec:L[z]) {
            grad[vec]--;
            if (grad[vec] == 0) {
                Q.push(vec);
            }
        }
    }
    return 0;
}