#include <bits/stdc++.h>

using namespace std;

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

#define INF (long long)10e16
#define NMAX 50000
#define VMAX 1000000


vector<int> adj[NMAX+1];
vector<int> topsort;
int indeg[NMAX+1];
int n,m;
int main()
{
    fin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin >> x >> y;
        adj[x].push_back(y);
        indeg[y]++;
    }
    queue<int> Q;
    for(int i=1;i<=n;i++)
    {
        if(indeg[i]==0)
        {
            Q.push(i);
        }
    }

    while(!Q.empty())
    {
        int node = Q.front();
        Q.pop();
        topsort.push_back(node);
        for(int y : adj[node])
        {
            indeg[y]--;
            if(!indeg[y])
            {
                Q.push(y);
            }
        }
    }
    for(int i : topsort)
    {
        fout << i << " ";
    }
}