#include <bits/stdc++.h>

using namespace std;

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

const int oo = (1 << 30);
const int NMAX = 50005;

int n, m;
vector<int>G[NMAX];
bool vizitat[NMAX];
int v[NMAX];
int k;

void citire()
{
    fin>>n>>m;
    for(int i = 1; i <= m; i++){
        int x, y;
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void dfs(int nod)
{
    vizitat[nod] = true;
    for(int i = 0; i < G[nod].size(); i++){
        int vecin = G[nod][i];
        if(!vizitat[vecin]){
            dfs(vecin);
        }
    }
    k++;
    v[k] = nod;
}

int main()
{
    citire();
    for(int i = 1; i <= n; i++){
        if(!vizitat[i]){
            dfs(i);
        }
    }
    for(int i = k; i >= 1; i--){
        fout<<v[i]<<" ";
    }
    return 0;
}