#include <bits/stdc++.h>

#define Nmax 10005

using namespace std;

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

int N, M;
int deg[Nmax];
vector <int> G[Nmax];
queue <int> Q;
int ans[Nmax];
int idx;

int main()
{
    fin >> N >> M;
    while(M--)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        deg[y]++;
    }
    for(int i = 1; i <= N; i++)
        if(deg[i] == 0)
            Q.push(i), ans[++idx] = i;
    while(!Q.empty())
    {
        int node = Q.front();
        Q.pop();
        for(auto it : G[node])
        {
            deg[it]--;
            if(deg[it] == 0)
                Q.push(it), ans[++idx] = it;
        }
    }
    for(int i = 1; i <= N; i++)
        fout << ans[i] << " ";
    fout << "\n";
    return 0;
}