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

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int NMAX = 5e4+5;
vector<int> graf[NMAX];
int grad[NMAX];
queue<int> coada;

int main()
{
    int n, m;
    f >> n >> m;
    while(m--) {
        int x, y;
        f >> x >> y;
        graf[x].push_back(y);
        grad[y]++;
    }
    for(int i = 1; i <= n; i++) {
        if(!grad[i]) {
            coada.push(i);
        }
    }
    while(!coada.empty()) {
        int nod = coada.front();
        coada.pop();
        g << nod << ' ';
        for(int i = 0; i < (int)graf[nod].size(); i++) {
            int next = graf[nod][i];
            grad[next]--;
            if(!grad[next]) {
                coada.push(next);
            }
        }
    }
    return 0;
}