#include <bits/stdc++.h>

using namespace std;

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

const int nMax = 50001;
int n, top;
int sol[nMax];
bool viz[nMax];
vector <int> L[nMax];

void Read() {
    int m, i, x, y;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> x >> y;
        L[x].push_back(y);
    }
    fin.close();
}

void DFS(int nod) {
    viz[nod] = 1;
    for (auto it : L[nod]) {
        if (!viz[it]) {
            DFS(it);
        }
    }
    sol[++top] = nod;
}

void Solve() {
    for (int i = 1; i <= n; i++) {
        if (!viz[i]) {
            DFS(i);
        }
    }
    for (int i = n; i > 0; i--) {
        fout << sol[i] << " ";
    }
    fout.close();
}

int main()
{
    Read();
    Solve();
    return 0;
}