#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int MAX=5e4 + 5;
vector <int> gr[MAX];
vector <int> sortaret(int n,vector <int> &grad)
{
	queue <int> q;
	for(int i=1; i<=n; i++)
	{
		if(!grad[i])
			q.push(i);
	}
	vector <int> sol;
	while(!q.empty())
	{
		int cur=q.front();
		sol.push_back(cur);
		q.pop();
		for(auto x: gr[cur])
		{
			grad[x]--;
			if(!grad[x])
				q.push(x);
		}
	}
	return sol;
}
int main(int argc, char const *argv[])
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	int n,m;
	scanf("%d%d",&n,&m);
	std::vector<int> grad(n+1,0);
	for(int i=1; i<=m; i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		gr[x].push_back(y);
		grad[y]++;
	}
	vector <int> rez=sortaret(n,grad);
	for(auto x: rez)
		printf("%d ",x);
	return 0;
}