#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define Maxn 50002
using namespace std;
int n, m, w[Maxn], sol[Maxn];
vector < int > V[Maxn];
void dfs(int x)
{
    int i;
    w[x] = 1;
    for (i = 0; i < V[x].size(); ++ i)
        if (!w[V[x][i]])
            dfs(V[x][i]);
    sol[++ sol[0]] = x;
}
void read()
{
    int x, y, i;
    scanf("%d %d", &n, &m);
    for (i = 1; i <= m; ++ i)
    {
        scanf("%d %d", &x, &y);
        V[x].push_back(y);
    }
    for (i = 1; i <= n; ++ i)
        if (!w[i])
        dfs(i);
}
void write()
{
    for (int i = n; i >= 1; -- i)
        printf("%d ",sol[i]);
}
int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    read();
    write();
    return 0;
}