#include <iostream>
#include <cstdio>
#include <vector>
#define MAXN 50050

using namespace std;

int n, m;
vector<int> v[MAXN];
vector<int> sol;
int viz[MAXN];

void recurs(int x)
{
    for (int i = 0; i < v[x].size(); i++)
        if (!viz[v[x][i]])
            recurs(v[x][i]);
    sol.push_back(x);
    viz[x] = 1;
}

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

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

    scanf("%d %d", &n, &m);
    int t1, t2;
    for (int i = 1; i <= m; i++)
    {
        scanf("%d %d", &t1, &t2);
        v[t1].push_back(t2);
    }
    sortaret();
    for (int i = sol.size()-1; i >= 0; i--)
        printf("%d ", sol[i]);

    return 0;
}