#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m, x, y, gi[50005];
vector <int> vecini[50005];

void citire()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        vecini[x].push_back(y);
        gi[y]++;
    }
}

void sortare()
{
    queue <int> c;
    int k = 0;
    for(int i = 1; i <= n; i++)
    {
        if(gi[i] == 0)
        {
            c.push(i);
            fout << i << ' ';
        }

    }

    while(!c.empty())
    {
        int e = c.front();
        int l = vecini[e].size();
        for(int nd = 0; nd < l; nd++)
        {
            gi[vecini[e][nd]]--;
            if(gi[vecini[e][nd]] == 0)
            {
                c.push(vecini[e][nd]);
                fout << vecini[e][nd] << ' ';
            }

        }
        c.pop();
    }
}

int main()
{
    citire();
    sortare();
    return 0;
}