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