#include <bits/stdc++.h>
#define N 50002
using namespace std;

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

set<int> h[N];
int gi[N] , ge[N];
int a[N] , k , n , m;
int fr[N];
vector<int> sol;
queue<int> q;
void Citire()
{
    int i, x , y;
    fin >> n >> m;
    for(i = 1 ; i <= m ; i++)
    {
        fin >> x >> y;
        ge[x]++;
        fr[x] = 1;
        fr[y] = 1;
        gi[y]++;
        h[x].insert(y);
    }
}

void Cerinta()
{
    int i;
    for(i = 1 ; i <= N - 2 ; i++)
        if(gi[i] == 0 && fr[i] == 1) q.push(i);
    while(!q.empty())
    {
        i = q.front();
        sol.push_back(i);
        q.pop();
        for(auto y : h[i])
        {
            gi[y]--;
            if(gi[y] == 0) q.push(y);
        }
    }
    if(sol.size() == n)
    {
        for(i = 0 ; i < n ; i++)
            fout << sol[i] << " ";
        return;
    }
    else fout << "-1";
}

int main()
{
    Citire();
    Cerinta();
    return 0;
}