#include <bits/stdc++.h>

using namespace std;

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

queue <int> q;
vector <int> L[50005];

int n, m, grad[50005];

void Citire()
{
    int x, y;
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
        grad[y]++;
    }
}

void Rez()
{
    for(int i = 1; i <= n; i++)
        if(grad[i] == 0)
            q.push(i);

    while(!q.empty())
    {
        int el = q.front();
        fout << el << " ";
        q.pop();

        for(auto i : L[el])
        {
            if((--grad[i]) == 0)
                q.push(i);
        }
    }
}
int main()
{
    Citire();
    Rez();
    return 0;
}