#include <bits/stdc++.h>

using namespace std;

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

int n, m;
//bool adiacente[101][101];
vector<vector<int> > adiacente(50000, vector<int>());
vector<int> sol;
vector<int> grad(50000,0);
//bool viz[101];

void sortTop() {
    queue<int> q;

    for(int i=1; i<=n; i++)
        if(grad[i]==0)
            q.push(i);

    while(!q.empty()){
        int nod = q.front();
        q.pop();
        sol.push_back(nod);

        for(int vecin : adiacente[nod]){
            grad[vecin]--;
            if(grad[vecin]==0)
                q.push(vecin);
        }
    }

    for(int nod : sol)
        fout<<nod<<" ";
}

void formMat(){
    int x, y;

    while(fin>>x>>y){
        adiacente[x].push_back(y);
        grad[y]++;
    }
}

int main(){
    fin>>n>>m;
    formMat();

    sortTop();

}