#include <bits/stdc++.h>

using namespace std;

vector<int> v[50010];
int grad[50010],top[50010];

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n,m,x,y;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        grad[y]++;
    }
    int l=0;
    for(int i=1;i<=n;i++)
        if(!grad[i]) top[++l]=i;
    for(int i=1;i<=l;i++)
        for(int j=0;j<v[top[i]].size();j++)
            if(--grad[v[top[i]][j]]==0) top[++l]=v[top[i]][j];
    for(int i=1;i<=n;i++) printf("%d ",top[i]);
    return 0;
}