#include <bits/stdc++.h>
using namespace std;
const int nm=1e5+5;
vector<int>L[nm];
int fr[50005];
int n,m;
void stp(){
    queue<int>q;
    vector<int>rez;
    for(int i=1;i<=n;i++){
        if(fr[i]==0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int x=q.front();
        q.pop();
        cout << x <<' ';
        for(auto it:L[x]){
            fr[it]--;
            if(fr[it]==0){
                q.push(it);
            }
        }
    }

}
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int a,b;
        cin >> a >> b;
        L[a].push_back(b);
        fr[b]++;
    }
    int cv=0;
    stp();

    return 0;
}