#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
#define N 100005

using namespace std;

vector <int> G[N];
queue <int> Q;
int n,m,v[N];

void citire()
{
    scanf("%d%d", &n,&m);
    for(int i=1; i<=m; i++)
    {
        int x,y;
        scanf("%d%d", &x,&y);
        G[x].push_back(y);
        v[y]++;
    }
}

void algoritm()
{
    for(int i=1; i<=n; i++)
        if(v[i]==0) Q.push(i);

    while(!Q.empty())
    {
        vector <int>::iterator it;
        int x=Q.front();
        Q.pop();
        for(it=G[x].begin(); it!=G[x].end(); it++)
        {
            v[*it]--;
            if(v[*it]==0) Q.push(*it);
        }
        printf("%d ",x);

    }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
  citire();
  algoritm();
    return 0;
}