#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 50005;
vector <int> G[NMAX];
int N, M, i, x, y, k;
int viz[NMAX], ST[NMAX];

void DFS(int x)
{
    viz[x] = 1;
    for (i=0; i< G[x].size(); i++)
        if (viz[G[x][i]]==0) DFS(G[x][i]);
    k++;
    ST[k]=x;
}
int main()
{
    freopen("sortaret.in", "r" , stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d%d\n", &N, &M);
    for (i = 1; i <= M; i++)
    {
        scanf("%d%d\n", &x, &y);
        G[x].push_back(y);
    }
    k = 0;
    for (i = 1; i <= N; i++)
        if (viz[i]==0) DFS(i);
    for (i = N; i >= 1; i--)
        printf("%d ",ST[i]);
    return 0;
}