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

using namespace std;

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

int n, m;

const int MAXN = 50004;
int hs[MAXN];
int result[MAXN], nq;
vector<int> edges[MAXN];

void kahn()
{
    for(int i = 1; i <= n; i++)
        if(!hs[i]) result[++nq] = i;

    for(int i = 1; i <= n; i++)
    {
        int crt = result[i];
        for(auto& it : edges[crt])
        {
            hs[it]--;
            if(!hs[it]) result[++nq] = it;
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        hs[y]++;
        edges[x].push_back(y);
    }

    kahn();
    for(int i = 1; i <= nq; i++)
        fout << result[i] << " ";
    return 0;
}