#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <bitset>
#define NMAX 50005

using namespace std;

int n, m;
vector<int> v[NMAX];
bitset<NMAX> viz;
int post[NMAX+1];

void read()
{
   int x, y;
   scanf("%d %d\n", &n, &m);
   for (int i=1; i<=m; ++i){
      scanf("%d %d\n", &x, &y);
      v[x].push_back(y);
   }
}

void dfs(int x)
{
   viz[x] = 1;
   for (vector<int>::iterator it = v[x].begin(); it != v[x].end(); ++it)
      if (!viz[*it])
         dfs(*it);
   post[++post[0]] = x;
}

void sortaret()
{
   for (int i=1; i<=n; i++)
      if (!viz[i])
         dfs(i);
   for (int i=post[0]; i>=1; --i)
      printf("%d ", post[i]);
}

int main()
{
   freopen("sortaret.in", "r", stdin);
   freopen("sortaret.out", "w", stdout);
   read();
   sortaret();

   return 0;
}