#include <bits/stdc++.h>

using namespace std;

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

int N, M;
bitset<50005>visited;
stack<int> s;
vector<vector<int> > adj;

void read(){
    fin >> N >> M;
    adj.resize(N + 1, vector<int>());

    for (int i = 1, x ,y; i <= M; ++i){
        fin >> x >> y;
        adj[x].push_back(y);
    }
}

void dfs(int node){
    visited[node] = 1;
    for (int x : adj[node]){
        if (!visited[x]){
            dfs(x);
        }
    }
    s.push(node);
}

void solve(){
    for (int i = 1; i <= N; ++i){
        if (!visited[i]){
            dfs(i);
        }
    }

    while(!s.empty()){
        fout << s.top() << " ";
        s.pop();
    }
}


int main()
{
    read();
    solve();
    return 0;
}