#include <bits/stdc++.h>

using namespace std;

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

vector <int> mv[50005];
int grad[50005];
int viz[50005];
int answer[50005];
int n,nr;

void DFS(int x){
    viz[x]=1;

    for(int i=0;i<mv[x].size();i++)
        if(!viz[mv[x][i]])
            DFS(mv[x][i]);

    nr++;
    answer[nr]=x;
}

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(!viz[i])
            DFS(i);

    for(i=n;i>0;i--)
        fout<<answer[i]<<" ";

    return 0;
}