#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#define Nmax 50003
///ordonare liniara a varfurilor
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int>graph[Nmax];
int viz[Nmax];
stack<int>STACK;

void DFS(int node)
{
    viz[node] = 1;
    int lim = graph[node].size();
    for(int i = 0; i < lim; i++)
    {
        int vecin = graph[node][i];
        if(viz[vecin] == 0)
            DFS(vecin);
    }
	STACK.push(node);
    }

int main()
{
   int n, m;
   f >> n >> m;
   int a, b;
   for(int i = 0; i < m; i ++)
   {
       f >> a >> b;
       graph[a].push_back(b);
   }
   for(int i = 1; i <= n; i++)
   {
       if(viz[i] == 0)
       {
           DFS(i);
       }
   }
for(int i = 1; i <= n; i ++)
{
	g << STACK.top() << " ";
	STACK.pop();
}
    return 0;
}