#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int nmx = 50002;

int n,m;
int grad[nmx];
vector <int> g[nmx];
queue <int> q;

void citire()
{
    scanf("%d", &n, &m);
    for(int i = 1; i <= m; ++i)
    {
        int nod1,nod2;
        scanf("%d %d", &nod1, &nod2);
        ++ grad[nod2];
        g[nod1].push_back(nod2);
    }
}

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

void sortaret()
{
    while(not q.empty())
    {
        int nod = q.front();
        q.pop();
        printf("%d ", nod);

        for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        {
            -- grad[*it];

            if(grad[*it] == 0)
            {
                q.push(*it);
                grad[*it] = -1;
            }
        }
    }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    citire();
    adaugare();
    sortaret();
    return 0;
}