#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int N = 1e5 + 10;
int n, m;
int h[N], ne[N], e[N], idx;
int q[N], hh = 0, tt = -1;
int rudu[N];

void add(int a, int b) {
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx ++ ;
}

int main() {
    cin >> n >> m;
    memset(h, -1, sizeof h);
    for (int i = 0; i < m; i ++ ) {
        int a, b;
        cin >> a >> b;
        add(a, b);
        rudu[b] ++ ;
    }
    for (int i = 1; i <= n; i ++ ) {
        if (rudu[i] == 0) q[++ tt] = i;
    }
    while (hh <= tt) {
        int t = q[hh];
        hh ++ ;
        for (int i = h[t]; i != -1; i = ne[i]) {
            int j = e[i];
            rudu[j] -- ;
            if (rudu[j] == 0) q[++ tt] = j;
        }
    }
    if (tt == n - 1) {
        for (int i = 0; i < n; i ++ ) cout << q[i] << ' ';
    }
    else cout << -1 << endl;
    return 0;
}