#include <fstream>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
const int NMAX=50005;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
queue <int> q;
vector <int> succ[NMAX];
vector <int> sol;
int pred[NMAX];
int main() {
    int n,m,x,y,aux;
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {   
        in>>x>>y;
        pred[y]++;
        succ[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
     if(pred[i]==0)
 q.push(i);
    while(!q.empty())
    {
        aux=q.front();
        sol.push_back(aux);
        for(int i=0;i<succ[aux].size();i++)
        {
            pred[succ[aux][i]]--;
            if(pred[succ[aux][i]]==0)
                q.push(succ[aux][i]);
        }
        q.pop();
    }
    if(sol.size()<n)
        out<<"-1\n";
    else
        for(int i=0;i<sol.size();i++)
            out<<sol[i]<<" ";
               
    return 0;
}