#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

#define max 50001
using namespace std;
int n,m;
vector <int> g[max];
int grad[max];
queue <int> q;

void citire()
{
    scanf("%d %d",&n,&m);
    int x,y;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        grad[y]++;
        g[x].push_back(y);
    }
}
void bfs()
{
    for(int i=1;i<=n;i++)
        if(grad[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int aux=q.front();
        printf("%d ",aux);
        for(vector <int>::iterator it=g[aux].begin();it!=g[aux].end();it++)
            {
                grad[*it]--;
                if(grad[*it]==0)
                    q.push(*it);
            }
        q.pop();
    }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    bfs();
    return 0;
}