#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>

using namespace std;

const int INF = 1 << 29;
typedef pair<int, int> P;

int m, n;

vector<int> ans;
vector<bool> visited;

vector<vector<int> > graph;

void visit(int node)
{
	if(visited[node]) return;
	visited[node] = true;
	int size = graph[node].size();
	for (int i = 0; i < size; i++)
	{
		visit(graph[node][i]);
	}
	ans.push_back(node);
}

int main(void)
{
	while(cin >> m >> n && m)
	{
		ans.clear();
		visited.resize(m);
		fill(visited.begin(), visited.end(), false);
		graph = vector<vector<int> >(m);

		for (int i = 0; i < n; i++)
		{
			int x, y;
			cin >> x >> y, x--, y--;
			graph[y].push_back(x);
		}

		visit(1);
		for (int i = 0; i < m; i++)
		{
			cout << ++ans[i] << endl;
		}
	}
	return 0;
}