#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

#define MAXN 50100

int N, M, deg[MAXN], Q[MAXN];
vector<int> G[MAXN];

void solve(void)
{
    int i, x;
    vector<int>::iterator it;

    for(x = 1; x <= N; x++)
        if(deg[x] == 0) Q[++Q[0]] = x;

    for(i = 1; i <= N; i++)
    {
        x = Q[i];
        for(it = G[x].begin(); it != G[x].end(); ++it)
        {
            deg[*it]--;
            if(deg[*it] == 0) Q[++Q[0]] = *it;
        }
    }
}

void read_data(void)
{
    int i, a, b;

    scanf("%d %d\n", &N, &M);
    for(i = 1; i <= M; i++)
    {
        scanf("%d %d\n", &a, &b);
        G[a].push_back(b);
        deg[b]++;
    }
}

void write_data(void)
{
    int i;

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

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

    read_data();
    solve();
    write_data();

    return 0;
}