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

#define NMAX 50100

using namespace std;

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

vector<int>     listaArce[NMAX];
int             deg[NMAX];
vector<int>     l;
int     n, m;

void    topologicalSort()
{
    for (int i = 1; i < n; i++)
        if (deg[i] == 0)
            l.push_back(i);
    
    for (int i = 0; i < l.size(); i++)
    {
        for (int j = 0; j < listaArce[l[i]].size(); j++)
        {
            deg[listaArce[l[i]][j]]--;
            if (deg[listaArce[l[i]][j]] == 0)
                l.push_back(listaArce[l[i]][j]);
        }
    }

    for (int i = 0; i < l.size(); i++)
        g << l[i] << ' ';
}

int		main()
{
	f >> n >> m;
	
	for (unsigned int i = 0; i < m; i++)
	{
		int nodS, nodD;
		f >> nodS >> nodD;
        listaArce[nodS].push_back(nodD);
        deg[nodD]++;
	}

    topologicalSort();
	return 0;
}