#include <fstream>
#include <queue>
#define DIM 50010

using namespace std;

vector<int> L[DIM];
queue<int> q;
int d[DIM];

int n, m, x, y, i, nod;

int main() {
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        L[x].push_back(y);
        d[y]++;
    }

    for (i=1;i<=n;i++)
        if (d[i] == 0) {
            q.push(i);
        }

    while (!q.empty()) {
        nod = q.front();
        q.pop();
        fout<<nod<<" ";
        for (i=0;i<L[nod].size();i++) {
            d[ L[nod][i] ]--;
            if (d[ L[nod][i] ] == 0)
                q.push(L[nod][i]);
        }
    }


    return 0;
}