#include <iostream>
#include <fstream>
#include <unordered_map>
#include<vector>
#include <queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int main(){
    queue<int>coada;
    unordered_map<int,vector<int>>adj_list;
    int n,m;
    int x,y;
    fin>>n>>m;
    vector<int>grade_interne(n+1,0);
    for(int i = 0; i < m; i++){
        fin>>x>>y;
        adj_list[x].push_back(y);
        grade_interne[y]++;
    }

    for(int i = 1; i <= n; i++){
        if(!grade_interne[i])
            coada.push(i);
    }
    while(!coada.empty())
    {
        int cap = coada.front();
        fout<<coada.front()<<" ";
        coada.pop();
        for(auto vecin: adj_list[cap])
        {
            grade_interne[vecin]--;
            if(!grade_interne[vecin])
                coada.push(vecin);
        }
    }
    return 0;
}