#include <fstream>
#include <vector>
#include <queue>
#include<cstdio>
using namespace std;
int x,y,n,i,k,b[50001],c[50001],m;
vector<int> a[50001];
queue<int> q;
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);
        a[x].push_back(y);
        b[y]++;
    }
    for(i=1;i<=n;i++)
        if(b[i]==0)
        {
         q.push(i);
         k++;
         c[k]=i;
        }
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<a[x].size();i++)
        {
            b[a[x][i]]--;
            if(b[a[x][i]]==0)
            {
             q.push(a[x][i]); k++;
             c[k]=a[x][i];
            }
        }
    }
    for(i=1;i<=n;i++)
      printf("%d ",c[i]);
    return 0;
}