#include <bits/stdc++.h>

using namespace std;

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

vector<int> G[50005];
vector<int> Gt[50005];
int viz[50005], TSORT[50005];
int n,m,ind;

void dfs(int nod){
    int i,vecin;
    viz[nod] = 1;
    for(i = 0; i < Gt[nod].size(); i++){
        vecin = Gt[nod][i];
        if(viz[vecin] == 0){
            dfs(vecin);
        }
    }
    TSORT[ind] = nod;
    ind++;
}

int main()
{
    int i,a,b;
    fin>>n>>m;
    for(i = 1; i <= m; i++){
        fin>>a>>b;
        G[a].push_back(b);
        Gt[b].push_back(a);
    }
    ind = 1;
    for(i = 1; i <= n; i++){
        if(viz[i] == 0){
            dfs(i);
        }
    }
    for(i = 1; i <= n; i++){
        fout<<TSORT[i]<<' ';
    }
    return 0;
}