#include <bits/stdc++.h>

using namespace std;

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

vector<int> lista[50001];
queue<int> q;
int degree[50001];

void parcurgere(){
    while(!q.empty()){
        int nod = q.front();
        fout<<nod<<' ';
        q.pop();
        for(auto vecin : lista[nod]){
            degree[vecin]--;
            if(degree[vecin] == 0){
                q.push(vecin);
            }

        }
    }

}

int main()
{
    int n,m,n1,n2;
    fin>>n>>m;

    for(int i=0;i<m;i++){
        fin>>n1>>n2;
        lista[n1].push_back(n2);
        degree[n2]++;
    }

    for(int i=1;i<=n;i++){
        if(degree[i] == 0){
            q.push(i);
        }
    }

    parcurgere();

    return 0;
}