#include <cstdio>
#include <algorithm>
#include<vector>

using namespace std;

int i,aux,n,k,j,p,s,unu,t,m,doi,x,q,st,dr,maxi,sol,maxi2,viz[100010],y,conex,topologic[100100];
vector <int> v[50010];

void afis()
{
    int p;
    for(p=1;p<=n;p++)
    {
        printf("%d ",viz[p]);
    }
    printf("\n");
}

void dfs(int x) {
    int i, y;
    viz[x] = 1;
    //printf("%d ",x);
    for (i = 0; i < v[x].size(); i++) {
        y = v[x][i];
        if (viz[y]==0)
            dfs(y);
    }
    k++;
    topologic[k]=x;
}

int main()
{
    freopen ("sortaret.in","r",stdin);
    freopen ("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
        //printf("%d %d\n",x,y);
    }

    for(i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
            //printf("\n");
        }
    }
    for(i=0;i<v[4].size();i++)
    {
         //printf("%d ",v[4][i]);
    }
    for(i=n;i>=1;i--)
    {
        printf("%d ",topologic[i]);
    }
}