#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int nmax = 50005;
int n, m, x, y, sol[nmax], i, lg;
vector <int> graf[nmax];
bool viz[nmax];
void dfs(int x)
{
    int j;
    viz[x]=1;
    for(j=1; j<=graf[x][0]; j++)
        if(!viz[graf[x][j]]) dfs(graf[x][j]);
    sol[++lg]=x;
}
int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(i=1; i<=n; i++)
        graf[i].push_back(0);
    for(i=1; i<=m; i++)
    {
        scanf("%d %d", &x, &y);
        graf[x][0]++;
        graf[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        if(!viz[i]) dfs(i);
    for(i=lg; i; i--)
        printf("%d ", sol[i]);
    return 0;
}