#include <bits/stdc++.h>
#define N 50000

using namespace std;

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

int n, m;
int grad[N + 1], Q[N + 1];
bool viz[N + 1];
vector <int> graf[N + 1];

void Add(int x, int y)
{
    graf[x].push_back(y);
    grad[y]++;
}

void Citire()
{
    int x, y;

    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        Add(x, y);
    }

}

void Bfs()
{
    int prim = 0, ultim = 1, nod, vecin;

    for(int i = 1; i <= n; i++)
        if(grad[i] == 0)
            Q[ultim++] = i;

    while(prim <= ultim)
    {
        nod = Q[prim++];
        for(int i = 0; i < graf[nod].size(); i++)
        {
            vecin = graf[nod][i];
            if(!viz[vecin])
            {
                grad[vecin]--;
                if(grad[vecin] == 0)
                    Q[ultim++] = vecin;
            }
        }
    }
}

void Afisare()
{
    int i = 1;
    while(Q[i])
    {
        fout << Q[i] << " ";
        i++;
    }
}

int main()
{
    Citire();

    Bfs();

    Afisare();
    return 0;
}