#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

vector <int> v[50001];

queue <int> coada;

int a[50001];

int main()
{
    int n,m;
    in>>n>>m;
    for(int i=0;i<m;i++){
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
        a[y]++;
    }
    for(int i=1;i<=n;i++)
        if(a[i]==0)
            coada.push(i);
    while(!coada.empty()){
        int x=coada.front();
        out<<x<<' ';
        coada.pop();
        for(auto y:v[x]){
            a[y]--;
            if(a[y]==0)
                coada.push(y);
        }
    }
    return 0;
}