#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const double EPS = 1e-10;
const int INF = 1001001001;

void func(vi evidence[], int num[], int now, int& cnt)
{
	if(num[now] != -1)
		return;
	rep(i, evidence[now].size())
		func(evidence, num, evidence[now][i], cnt);
	num[now] = cnt;
	++cnt;
}

int main()
{
	int n, m;
	scanf("%d%d", &n, &m);
	
	vi evidence[20];
	rep(i, m){
		int a, b;
		scanf("%d%d", &a, &b);
		--a;
		--b;
		evidence[b].push_back(a);
	}
	
	int num[20], cnt=0;
	fill(num, num+n, -1);
	rep(i, n)
		func(evidence, num, i, cnt);
	
	int tmp[20];
	rep(i, n)
		tmp[num[i]] = i;
	
	rep(i, n)
		printf("%d\n", tmp[i]+1);
	
	return 0;
}