#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>

using namespace std;

int N, M;
vector<int> L[50001];
deque<int> T;
bool viz[50001];

void topsort_dfs(int u)
{
    viz[u] = true;
    for(const auto& v : L[u])
        if(!viz[v])
            topsort_dfs(v);
    T.push_front(u);
}

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

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

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

    for(const auto& u : T)
        fout << u << ' ';

    fin.close();
    fout.close();

    return 0;
}