#include <iostream>
#include <fstream>
#include <vector>
#define MAX 50002
using namespace std;
int n,m,x,y,g[MAX],vf[MAX];
vector<int> v[MAX],sol;

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

void dfs(int nod){
    vf[nod] = 1;
    for(auto vecin: v[nod]){
        if(vf[vecin] == 0){
            dfs(vecin);
        }
    }
    sol.push_back(nod);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        g[y]++;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; i++){
        if(g[i] == 0){
            dfs(i);
        }
    }
    for(int i = sol.size()-1; i >= 0; i--){
        fout << sol[i] << " ";
    }
    return 0;
}