#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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

int n, m;
vector<bool> visitat;
vector<vector<int>> vecini;
vector<int> ordine;

void dfs(int idx) {
    visitat[idx] = true;
    
    for(int neighborIdx : vecini[idx])
        if(!visitat[neighborIdx])
            dfs(neighborIdx);
            
    ordine.push_back(idx);
}

int main() {
    int n, m; fin >> n >> m;
    
    visitat.resize(n + 1);
    vecini.resize(n + 1);
    
    for(int i = 0; i < m; ++i) {
        int x, y; fin >> x >> y;
        vecini[x].push_back(y);
    }
    
    for(int i = 1; i <= n; ++i)
        reverse(vecini[i].begin(), vecini[i].end());
    
    for(int i = 1; i <= n; ++i)
        if(!visitat[i])
            dfs(i);
    
    for(int i = n - 1; i >= 0; --i)
        fout << ordine[i] << ' ';
    
    return 0;
}