#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>

using namespace std;

vector<int>g[50001];
queue<int>q;
int gradext[50001];
int n,m;

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

void sortare()
{
    for(int i=1;i<=n;i++)
        if(gradext[i]==0)
            q.push(i);
    for(int i=1;i<=n;i++)
    {
        int nod = q.front();
        printf("%d ",nod);
        q.pop();
        int nrv = g[nod].size();
        for(int j=0;j<nrv;j++)
        {
            gradext[g[nod][j]]--;
            if(gradext[g[nod][j]]==0)
                q.push(g[nod][j]);

        }
    }
}

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