#include <bits/stdc++.h>
using namespace std;
#define LMAX 100005
int n;
bool viz[LMAX];
vector<int> G[LMAX];
int top=0,st[LMAX];
void dfs(int nod){
    viz[nod]=1;
    for(auto it : G[nod])
        if(!viz[it])
            dfs(it);
    st[++top]=nod;
}
void sortT(){
    for(int i=1;i<=n;++i)
        if(!viz[i])
            dfs(i);
    for(int i=top;i>=1;--i)
        printf("%d ",st[i]);
}
int main(){
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int m;
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;++i){
        int from,to;
        scanf("%d %d",&from,&to);
        G[from].push_back(to);
    }
    sortT();
    return 0;
}