#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>

#define N 50005

using namespace std;

int n,m,x,y;
vector <int> g[N], sol;
bitset <N> viz;

void dfs(int nod){
    viz[nod] = 1;
    for(int i : g[nod])
        if(!viz[i])
            dfs(i);
    sol.push_back(nod);
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d%d", &n,&m);
    for(int i = 0; i < m; ++i){
        scanf("%d%d", &x,&y);
        g[x].push_back(y);
    }

    dfs(1);

    for(int i = n-1; i >= 0; --i)
        cout<<sol[i]<<" ";

    return 0;
}