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

using namespace std;

int n,m,grad[N];

vector <int> G[N];

queue <int> q;

void sort_bfs()
{
    for(int i=1; i<=n; i++)
    {
        if(!grad[i])
        {
             q.push(i);
        }
    }

    while(!q.empty())
    {
        int tmp=q.front();

        printf("%d ",tmp);

        q.pop();

        vector<int>::iterator it;

        for(it=G[tmp].begin(); it<G[tmp].end(); ++it)
        {
            grad[*it]--;
            if(!grad[*it])
            {
                q.push(*it);
            }
        }
    }
}

void citire()
{
    scanf("%d %d\n",&n,&m);

    for(int i=0; i<m; i++)
    {
        int x,y;
        scanf("%d %d\n",&x,&y);

        G[x].push_back(y);
        grad[y]++;
    }

    sort_bfs();
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    citire();

    return 0;
}