#include<bits/stdc++.h>

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)

#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;
typedef long double ld;

const int nmax=1025;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;

using namespace std;

int f[50100],q[50100];
vector<int>v[50100];

int main()
{
  freopen("sortaret.in","r",stdin);
  freopen("sortaret.out","w",stdout);
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n,m;
  cin>>n>>m;
  while(m--)
  {
    int x,y;
    v[x].push_back(y);
    f[y]++;
  }
  for(int i=1;i<=n;i++)
  if(!f[i]) q[++q[0]]=i;
  for(int i=1;i<=n;i++)
  {
    int nod=q[i];
    for(int j=0;j<v[nod].size();j++)
    {
      f[v[nod][j]]--;
      if(!f[v[nod][j]]) q[++q[0]]=v[nod][j];
    }
  }
  for(int i=1;i<=n;i++) cout<<q[i]<<" ";
}