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

using namespace std;

vector<int>p[50010];
queue<int>q;
int s[50010];
int n,m;

void par(int x)
{
    if(s[x]==0)
    {
        printf("%d ",x);
        s[x]=1;
        for(int i=0; i<p[x].size(); i++)
            par(p[x][i]);
    }
}

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

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

    for(int i=1; i<=n; i++)
    {
        if(s[i]==0)
            q.push(i);
        s[i]=0;
    }

    while(!q.empty())
    {
        par(q.front());
        q.pop();
    }

    return 0;
}