///dezbateri campion
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define MAXN 50005
int N, M, viz[MAXN], deg[MAXN],afisare[MAXN];
vector<int> G[MAXN];
void solve_and_write(void)
{
    int i, j, k,soln=0;
    for(i = 1; i <= N; i++)
    {
        for(j = 1; j <= N; j++)
            if(!viz[j] && deg[j] == 0)
            {
                viz[j] = 1 ;
                afisare[++soln]=j;
                for(k = 0; k < G[j].size(); k++)
                    deg[ G[j][k] ]--;
                break ;
            }
    }
    if(soln<N)
        printf("0");
    else
        for(i = 1; i <= N; i++)
            printf("%d ",afisare[i]);
}
void read_data(void)
{
    int i,a,b;
    scanf("%d %d\n", &N, &M);
    for(i = 1; i <= M; i++)
    {
        scanf("%d %d", &a, &b);
        G[a].push_back(b);
        deg[b]++;
    }
}
int main()
{
    freopen("sortaret.in", "rt", stdin);
    freopen("sortaret.out", "wt", stdout);
    read_data();
    solve_and_write();
    return 0;
}