# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <map>
# include <stack>
using namespace std;
# define M_PI 3.141592
# define FOR(i,n) for(int i=0;i<(int)n;i++)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define toRad 2.0*M_PI/360.0
# define inin(x) int x;cin>>x;
# define all(x) x.begin(),x.end()
# define debug(x) cout<<#x<<" :"<<x<<endl;
# define rep(i,n) for(int i=0;i<(int)n;i++)
# define EPS 1e-12
# define CHECK(i,a) FOR(i,a.size())cout<<#a<<"["<<i<<"] : "<<a[i]<<endl; 

int m, n;
vector<int> a[21];
int main()
{
	cin >> m >> n;
	FOR(i, n)
	{
		int x, y; cin >> x >> y;
		a[y].push_back(x);
	}
	queue<int> q;
	q.push(2);
	vector<int> ans;
	while (!q.empty())
	{
		int now = q.front();
		q.pop();
		ans.push_back(now);
		for (int i = 0; i < a[now].size();i++)
		{
			int next = a[now][i];
			a[now].erase(a[now].begin() + i);
			i--;
			bool ok = true;
			for (int j = 1; j <= m; j++)
			{
				for (int k = 0; k < a[j].size(); k++)
				{
					if (a[j][k] == next)
						ok = false;
				}
			}
			if (ok)
			{
				q.push(next);
			}
		}
	}
	reverse(all(ans));
	int h[21] = {};
	for (int i = 0; i < ans.size(); i++)h[ans[i]] = 1;
	for (int i = 1; i <= m; i++)
	{
		if (h[i] == 0)cout << i << endl;
	}
	for (int i = 0; i < ans.size(); i++)cout << ans[i] << endl;
}