#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> L(50001);
bitset<50001> viz;
vector<int> stiva;
int n, m;

void DFS(int k)
{
    if(viz[k] == 1) return;
    viz[k] = 1;
    for(const auto& w: L[k])
        if(viz[w] == 0) DFS(w);
    stiva.push_back(k);
}

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    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 = stiva.size() - 1; i >= 0; i--)
        fout << stiva[i] << " ";
    fin.close();
    fout.close();
    return 0;
}