#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
const int NMAX = 50000;
int n, m, x, y, i;
bool viz[NMAX + 5];
vector <int> g[NMAX + 5] , ans;
queue<int> q;
void BFS(int s);
void DFS(int k);
int main() {
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin >> n >> m;
    for(i = 1; i <= m; ++i) {
        cin >> x >> y;
        g[x].push_back(y);
    }
    
    for(i = 1; i <= n; ++i)
        if(!viz[i])
            DFS(i);
    
    vector<int>:: iterator it;
    for(it = ans.end() - 1; it >= ans.begin(); --it)
        cout << *it << " ";
    cout << "\n";
    return 0;
}
void DFS(int k) {
    viz[k] = 1;
    vector<int>:: iterator it;
    for(it = g[k].begin(); it < g[k].end(); ++it)
        if(!viz[*it])
            DFS(*it);
    ans.push_back(k);
}