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

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

int n, m;
vector<vector<int>> adj_list;
vector<int> in_degree;

void read()
{
    fin>>n>>m;
    adj_list.reserve(n+1);
    in_degree.reserve(n+1);
    for(int i=1; i<=n; i++)
        in_degree[i] = 0;

    for(int i=0; i<m; i++)
    {
        int x, y;
        fin>>x>>y;

        adj_list[x].push_back(y);
        in_degree[y]++;
    }
}

void solve()
{
    vector<int> ans;
    queue<int> Q;
    for(int i=1; i<=n; i++)
    {
        if(in_degree[i] == 0)
        {
            Q.push(i);
        }   
    }

    while(!Q.empty())
    {
        int curr = Q.front();
        Q.pop();
        ans.push_back(curr);    

        for(auto &neighbour:adj_list[curr])
        {
            in_degree[neighbour]--;
            if(in_degree[neighbour] == 0)
            {
                Q.push(neighbour);
            }  
        }
    }

    if(ans.size() != n)
        fout<<-1;
    else
    {
        for(auto &x:ans)
            fout<<x<<' ';
    }
}


int main()
{       
    read();
    solve();
    return 0;
}