#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
#define EPS 1e-10
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
typedef pair<int, int> P;

bool isLeap(int y);
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
double distanceAB(double xa, double ya, double xb, double yb);
void trace(int A[], int N);

/*
class Target
{
public:
	vector <string> draw(int n)
	{

	}
};
*/


vector<int> G[21];
int color[21];
vector<int> res;
int m, n, x, y;

void dfs(int id)
{
	color[id] = 1;
	rep(i, G[id].size())
	{
		if (color[G[id][i]] == 0) dfs(G[id][i]);
	}
	res.push_back(id);
}

void topologicalSort()
{
	for (int i=1; i<=m; i++)
	{
		if (color[i] == 0) dfs(i);
	}
}


int main()
{
	cin >> m >> n;
	rep(i, n)
	{
		cin >> x >> y;
		if (y == 2) continue;
		G[x].push_back(y);
	}
	
	rep(i, 21) color[i] = 0;
	topologicalSort();
	res.push_back(2);
	
	rep(i, res.size()) cout << res[i] << endl;
	
	return 0;
}


bool isLeap(int y)
{
	return y % 400 == 0
						? true : y % 100 == 0
						? false : y % 4 == 0
						? true : false;
}

ll gcd(ll a, ll b)
{
	return (b > 0) ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}

void trace(int A[], int N)
{
	REP(N)
	{
		if (i > 0) cout << " ";
		cout << A[i];
	}
	cout << endl;
}

double distanceAB(double xa, double ya, double xb, double yb)
{
	return sqrt((xb-xa)*(xb-xa) + (yb-ya)*(yb-ya));
}