#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 5e4 + 2;
int n, m, g[NMAX], p[NMAX];
vector<int> v[NMAX];

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        g[y]++;
    }
    deque<int> dq;
    for(int i = 1; i <= n; i++)
    {
        if(g[i] == 0)
        {
            dq.push_back(i);
        }
    }
    int k = 0;
    while(!dq.empty())
    {
        int nod = dq.front();
        dq.pop_front();
        p[++k] = nod;
        for(auto vecin: v[nod])
        {
            g[vecin]--;
            if(g[vecin] == 0)
            {
                dq.push_back(vecin);
            }
        }
    }
    for(int i = 1; i <= k; i++)
    {
        fout << p[i] << " ";
    }
    return 0;
}