#include <fstream>
#include <queue>
#include <vector>
#define NMAX 50005
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,gradIN[NMAX];
vector<int> G[NMAX],L;
queue<int> coada;
void citire(){
    f>>n>>m;
    int i,x,y;
    for(i=1;i<=m;i++){
        f>>x>>y;
        gradIN[y]++;
        G[x].push_back(y);
    }
}
void kahn(){
    int i;
    for(i=1;i<=n;i++)
        if(gradIN[i]==0)
            coada.push(i);
    while(!coada.empty()){
        int x=coada.front();
        L.push_back(x);
        for(vector<int>::iterator it=G[x].begin();it!=G[x].end();it++){
            gradIN[*it]--;
            if(gradIN[*it]==0)
                coada.push(*it);
        }
        coada.pop();
    }
    for(vector<int>::iterator it=L.begin();it!=L.end();it++)
        g<<*it<<' ';
}
int main(){
    citire();
    kahn();
    return 0;
}