#include <bits/stdc++.h>

using namespace std;

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

vector <int> mv[50005];
int grad[50005];
int used[50005];
int n;

void DFS(int x){
    int i;

    fout<<x<<" ";
    used[x]=1;

    for(i=0;i<mv[x].size();i++)
        grad[mv[x][i]]--;

    mv[x].clear();
}

int main(){
    int m,x,y,i;

    fin>>n>>m;

    for(i=1;i<=m;i++){
        fin>>x>>y;
        mv[x].push_back(y);
        grad[y]++;
    }

    for(i=1;i<=n;i++)
        if(!grad[i] && !used[i]){
            DFS(i);
        }

    return 0;
}