#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
queue <int> q;
vector <int> succ[50010];
int sol[50010],pred[50010];
int main()
{
     freopen("sortaret.in","r",stdin);
     freopen("sortaret.out","w ",stdout);
     int n,r,i,x,y;
     scanf("%d%d",&n,&r);
     for(i=1;i<=r;i++)
          {
              scanf("%d%d",&x,&y);
              pred[y]++;
              succ[x].push_back(y);
          }
     for(i=1;i<=n;i++)
          if(!pred[i])
               q.push(i);
     while(!q.empty())
          {
               x=q.front();
               for(i=0;i<succ[x].size();i++)
                    {
                         pred[succ[x][i]]--;
                         if(pred[succ[x][i]]==0)
                              q.push(succ[x][i]);
                    }
               sol[++sol[0]]=x;
               q.pop();
          }
     if(sol[0]!=n)
          printf("Nu exista solutie\n");
     else
          {
               for(i=1;i<=sol[0];i++)
                    printf("%d ",sol[i]);
          }
     return 0;
}