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

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

int n, m, x, y, used[50001];
vector<vector<int>> adj (50001);
vector<int> v;

void dfs(int nod){
    used[nod] = 1;
    for(int x : adj[x])
        if(used[x] == 0)
            dfs(x);
    v.push_back(nod);
}

int main(){

    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        adj[x].push_back(y);
    }
    
    for(int i = 1; i <= n; i++){
        if(used[i] == 0)
            dfs(i);
    }

    for(int i = v.size() - 1; i >= 0; i--)
        fout << v[i] << ' ';

    //fout << "ok";
}