#include <bits/stdc++.h>

using namespace std;

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

vector <int> L[500005];
int N, M, R[500005], Nr;
int Viz[500005];

void DFS(int K)
{
    Viz[K] = 1;
    for(auto i : L[K])
    {
        if(Viz[i] == 0) DFS(i);
    }
    R[++Nr] = K;
}

int main()
{
    int i, x, y;
    fin >> N >> M;
    for(i = 1 ; i <= M ; ++i)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }

    for(i = 1 ; i <= N ; ++i)
    {
        if(Viz[i] == 0) DFS(i);
    }

    for(i = N ; i >= 1 ; --i)
        fout << R[i] << " ";
    return 0;
}