#include <bits/stdc++.h>

using namespace std;

#define FILE_IO

int N, M, K;
int f[100005];
vector <int> edg[100005];
int ord[100005];

void DFS(int nod)
{
    if(f[nod])  return;
    f[nod] = 1;
    for(auto nxt: edg[nod])
        DFS(nxt);
    ord[K--] = nod;
}

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

    scanf("%d%d", &N, &M);
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        edg[x].push_back(y);
    }

    K = N;
    for(int i = 1; i <= N; i++)
        DFS(i);

    for(int i = 1; i <= N; i++)
        printf("%d ", ord[i]);

    return 0;
}