#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

void khan(int n,const vector<vector<int>>&graf,vector<int>&grad_interior,vector<int>&sol){
    queue<int>q;
    for(int i=1;i<=n;i++)
        if(!grad_interior[i])
            q.push(i);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        sol.push_back(u);
        for(int vecin:graf[u]){
            grad_interior[vecin]--;
            if(!grad_interior[vecin]){
                q.push(vecin);
            }
        }
    }
    for(int i=0;i<n;i++){
        out<<sol[i]<<" ";
    }
}

int main(){
    int n,m,x,y;
    in>>n>>m;
    vector<vector<int>>graf(n+1);
    vector<int>sol;
    vector<int>grad_interior(n+1,0);
    for(int i=1;i<=m;i++){
        in>>x>>y;
        graf[x].push_back(y);
        grad_interior[y]++;
    }
    khan(n,graf,grad_interior,sol);
}