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

vector <int> g[50005];
int viz[50005];
int topo[50005];
int nr;

void dfs(int u)
{
    viz[u] = 1;
    for(int i = 0; i < g[i].size(); ++i)
    {
        int v = g[u][i];
        if(!viz[v])
            dfs(v);
    }
    topo[++nr] = u;
}

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

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

    for(int i = 1; i <= n; ++i)
    {
        if(!viz[i])
            dfs(i);
    }

    for(int i = 1; i <= n; ++i)
    {
        printf("%d ", topo[i]);
    }
    return 0;
}