#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<vector<int>> graf;
vector<int> viz;
vector<int> grade;
queue<int> coada;
vector<int> afis;

int n, m;

void grade_interioare()
{
    for(int i=1; i<=n; i++)
        for(auto& j : graf[i])
            grade[j]++;
}

/*
void bfs(int x)
{
    viz[x] = 1;
    noduri_vizitate++;
    while(!coada.empty())
    {
        for(auto &i : graft[x])
        {
            if(viz[i] == 0)
            {
                viz[i] = 1;
                // niv[i] = niv[x] + 1;
                noduri_vizitate++;
                coada.push(i);
            }
        }
        coada.pop();
        if(!coada.empty())
            x = coada.front();
    }
}*/

int main()
{
    fin>>n>>m;
    graf.resize(n+1);
    viz.assign(n+1, 0);
    grade.assign(n+1, 0);
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin>>x>>y;
        graf[x].push_back(y);
    }

    grade_interioare();

    for(int i=1; i<=n; i++)
        if(grade[i] == 0)
            coada.push(i);

    while (!coada.empty())
    {
        int x = coada.front();
        for(auto& i : graf[x])
        {
            grade[i] -= 1;
            if(grade[i] == 0)
                coada.push(i);
        }
        afis.push_back(x);
        coada.pop();
    }

        for(auto& i : afis)
            fout<<i<<' ';

    return 0;
}