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

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

int n, m, x, y;
vector<vector<int> > G;
vector<int> viz;
stack<int> S;

void dfs(int node){
    viz[node] = 1;
    for(int x : G[node])
        if(!viz[x])
            dfs(x);
    S.push(node);
}

int main(){
    fin >> n >> m;

    G.resize(n + 1);
    viz.resize(n + 1);

    for(;m--;){
        fin >> x >> y;
        G[x].push_back(y);
    }

    for(int i = 1; i <= n; ++i)
        if(!viz[i])
            dfs(i);

    for(;!S.empty(); S.pop())
        fout << S.top() << ' ';
}