#include <iostream>
#include <fstream>
#include <vector>
#define MAX_N 50001
using namespace std;

int vizitati[MAX_N];
vector<int> graf[MAX_N];
vector<int> sol;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void dfs(int start) {
    vector<int>::iterator it;
    for (it = graf[start].begin(); it != graf[start].end(); it++) {
        if (vizitati[(*it)] == 0)
            dfs((*it));
    }
    
    vizitati[start] = 1;
    sol.push_back(start);
}

int main() {
    int n, m;
    fin>>n>>m;
    
    for (int i = 0; i < m; i++) {
        int a, b;
        fin>>a>>b;
        graf[a].push_back(b);
    }
    
    for (int i = 1; i <= n; i++) {
        if (vizitati[i] == 0)
            dfs(i);
    }
    
    vector<int>::iterator it;
    for (it = sol.end() - 1; it != sol.begin() - 1; it--) {
        fout<<(*it)<<" ";
    }
    return 0;
}