#include<iostream>
#include<fstream>
#include<queue>
using namespace std;
#define foreach(v)  for(typeof (v).begin() it=(v).begin();it!=(v).end();it++)
vector<int> q[50005];

queue<int> Q;
int n,m,deg[50005],rez[50005];
ofstream fout("sortaret.out");
inline void citire()
{int x,y,i;
    ifstream fin("sortaret.in");
     fin>>n>>m;
     for(i=1;i<=m;i++)
      {fin>>x>>y;
      q[x].push_back(y);
      deg[y]++;
      }
      fin.close();
}


int main()
{int u,contor,i;
    citire();
    for(i=1;i<=n;i++)
    if(deg[i]==0)
      Q.push(i);
    contor=0;
    while(!Q.empty())
    {u=Q.front();
    Q.pop();
    contor++;
    rez[contor]=u;
    foreach(q[u])
    {deg[*it]--;
    if(deg[*it]==0) Q.push(*it);
    }
    }
    for(i=1;i<=n;i++)
       fout<<rez[i]<<" ";
    fout.close();
    return 0;
}