#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <bitset>
#define NMAX 50008

using namespace std;

int n, m;
vector<int> v[NMAX];
stack<int> inverseList;
bitset<NMAX> viz;

void readData()
{
   int x, y;
   scanf("%d %d\n", &n, &m);
   for (int i = 0; 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);
   }
   inverseList.push(x);
}

void printData()
{
   while (!inverseList.empty()){
      printf("%d ", inverseList.top());
      inverseList.pop();
   }
}

int main()
{
   freopen("sortaret.in", "r", stdin);
   freopen("sortaret.out", "w", stdout);
   readData();
   for (int i = 1; i <= n; ++i)
      if (!viz[i])
         dfs(i);
   printData();

   return 0;
}