#include <iostream>
#include <map>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

queue <int> q;
vector <int> v[50001];
vector <int> ans;
int grd_intern[50001];
int n, m;

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i ++) {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
        grd_intern[b] ++;

    }

    for (int i = 1; i <= n; i ++)
        if (grd_intern[i] == 0)
            q.push(i);

    while (!q.empty()) {

        int nod = q.front();
        ans.push_back(nod);
        q.pop();

        for (auto vecin : v[nod]) {

            grd_intern[vecin] --;

            if (grd_intern[vecin] == 0)
                q.push(vecin);
        }
    }

    for (auto i : ans)
        fout << i << " ";

    return 0;
}