#include <bits/stdc++.h>

using namespace std;

const int NMAX = 5e4;
vector <int> v[NMAX + 5];
queue <int> q;
int id[NMAX + 5];

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    int n,m,x,y;
    fin >> n >> m;
    for (int i = 0;i < m;i++) {
        fin >> x >> y;
        v[x].push_back(y);
        id[y]++;
    }
    for (int i = 1;i <= n;i++)
        if (!id[i])
            q.push(i);
    while (!q.empty()) {
        x = q.front();
        q.pop();
        fout << x << ' ';
        for (int i = 0;i < v[x].size();i++) {
            id[v[x][i]]--;
            if (!id[v[x][i]])
                q.push(v[x][i]);
        }
    }
    return 0;
}