#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>


using namespace std;
const int MOD = 1000000009; // check!!!
const int INF = 100000000; //1e8

typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)

typedef vector<vector<int> > Graph;

bool visit(const Graph &g, int v, vector<int> &order, vector<int> &color) {
	color[v] = 1;
	FOR(i,sz(g[v])) {
		if (color[g[v][i]] == 2) continue; //vectorに追加済
		if (color[g[v][i]] == 1) return false; //DFSで既に訪れている -> loop検出
		if (!visit(g, g[v][i], order, color)) return false;
	}
	order.push_back(v); color[v] = 2;
	return true;
}
bool topological_sort(const Graph &g, vector<int> &order) {
	order.clear();
	int n = g.size();
	vector<int> color(n);
	FOR(u, n) if (!color[u] && !visit(g, u, order, color)) return false;
	reverse(order.begin(),order.end());
	return true;
}



int main(){

	int m,n; cin>>m>>n;
	Graph g(m);
	FOR(i,n){
		int x,y; cin>>x>>y;
		x--; y--;
		g[x].push_back(y);
	}

	vector<int> ans;
	topological_sort(g,ans);

	FOR(i,sz(ans)) cout << ans[i] + 1 << endl;

	return 0;
}