#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream input("sortaret.in");
ofstream output("sortaret.out");

#define MAXN 50100

int n, m, grad[MAXN], Q[MAXN]; vector<int> G[MAXN];

int main()
{	
	input >> n >> m;	
	
	for(int i = 0, a, b; i < m; i++)
	{
		input >> a >> b;
		G[a].push_back(b);
		grad[b]++;
	}
	
	for(int i = 1; i <= n; i++)
	{
		if(grad[i] == 0)
		{
			Q[++Q[0]] = i;
		}
	}
	
	vector<int>::iterator it;
	
	for(int i = 1; i <= n; i++)
    {
        int x = Q[i];
        for(it = G[x].begin(); it != G[x].end(); ++it)
        {
            grad[*it]--;
            if(grad[*it] == 0) 
            {
				Q[++Q[0]] = *it;
			}
        }
    }
    
    for(int i = 1; i <= n; i++)
    {
    	output << Q[i] << " ";
	}
		
	return 0;
}