#include <cstdio>
#include <vector>

using namespace std;

const int nmx = 100002;

int n,m;
vector <int> g[nmx],srt;
bool viz[nmx];

void input() {
    scanf("%d %d", &n, &m);
    int nod1,nod2;
    for(int i = 1; i <= m; ++i) {
        scanf("%d %d", &nod1, &nod2);
        g[nod1].push_back(nod2);
    }
}

void sortaret(int nod) {
    for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        if(not viz[*it]) {
            viz[*it] = true;
            sortaret(*it);
        }
    srt.push_back(nod);
}

int main() {
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    input();

    for(int i = 1; i <= n; ++i)
        if(not viz[i]) {
            viz[i] = true;
            sortaret(i);
        }

    for(vector<int>::reverse_iterator it = srt.rbegin(); it != srt.rend(); ++it)
        printf("%d ", *it);

    return 0;
}