#include <bits/stdc++.h>
using namespace std;
#define MAX 50005
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int N,M,sol=0;
vector<int> A[MAX];
vector<int> sortat;
bool viz[MAX]= {0};
void DFS(int nod)
{
    viz[nod] = true;
    for(auto temp:A[nod])
        if(!viz[temp])
            DFS(temp);
    sortat.push_back(nod);
}
int main()
{
    in >> N >> M;
    int x, y;
    for(int i = 1; i <= M; i++)   // Lista de adiacenta
    {
        in >> x >> y;
        A[x].push_back(y);
    }

    for(int i = 1; i <= N; i++)
        if(!viz[i])
        {
            DFS(i);
        }

    for(int i= sortat.size()-1; i>=0; i--)
        out<<sortat[i]<<" ";
    return 0;
}