#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int NMAX = 50001;
vector<int> vec[NMAX], sorted;
int n, m, in[NMAX];

void topsort()
{
    queue<int> q;
    for(int i = 1; i <= n; i++)
        if(in[i] == 0)
            q.push(i);
    while(!q.empty())
    {
        int nod = q.front(); q.pop();
        sorted.push_back(nod);
        for(int vecin : vec[nod])
        {
            in[vecin]--;
            if(in[vecin] == 0)
                q.push(vecin);
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr);

    fin >> n >> m;
    while(m--)
    {
        int x, y;
        fin >> x >> y;
        vec[x].push_back(y);
        in[y]++;
    }
    topsort();
    for(int nod : sorted)
        fout << nod << " ";

    return 0;
}