#include<iostream>
#include<cstring>
#include<queue>

using namespace std;
const int N = 1e5 + 10;
int n, m;
int h[N], e[N], ne[N], idx;
int d[N];
queue<int> q, r;
void add(int a, int b)
{
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx ++;
}
bool topsort()
{
    for (int i = 1; i <= n; i ++) {
        if (!d[i])  q.push(i);
    }
    while (q.size()) {
        int t = q.front();
        r.push(t);
        q.pop();
        for (int i = h[t]; i != -1; i = ne[i]) {
            int j = e[i];
            if (-- d[j] == 0)   q.push(j);
        }
    }
    return r.size() == n;
}
int main()
{
    cin >> n >> m;
    memset(h, -1, sizeof(h));
    while (m --) {
        int a, b;
        cin >> a >> b;
        add(a, b);
        d[b] ++;
    }
    if (topsort()) {
        while (r.size()) {
            cout << r.front() << ' ';
            r.pop();
        }
    }
    else    puts("-1");
    return 0;
}