#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int NMAX=50002;
vector<int> v[NMAX];
int gradI[NMAX];
int p[NMAX];
int n,m;
int main(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
        gradI[y]++;
    }
    deque<int> dq;
    for(int i=1;i<=n;i++){
        if(gradI[i]==0){
            dq.push_front(i);
        }
    }
    int k=0;
    while(!dq.empty()){
        int nod=dq.back();
        p[++k]=nod;
        dq.pop_back();
        for(auto vecin : v[nod]){
            gradI[vecin]--;
            if(gradI[vecin]==0){
                dq.push_front(vecin);
            }
        }
    }
    for(int i=1;i<=n;i++){
        fout<<p[i]<<" ";
    }
    return 0;
}