#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
bool used[100]={false};
//int d[100][100]={{0}};
vector<int> d[100];
vector<int> ord;
bool in[100]={false};
void dfs(int v){
	used[v]=true;
	for(int i =0;i <d[v].size();i++){
		if(!used[d[v][i]])dfs(d[v][i]);
	}
	ord.push_back(v);
}

int main(){
	int m;
	int n;
	cin>>m>>n;
	for(int i =0;i <n;i++){
		int x,y;
		cin>>x>>y;
		d[--x].push_back(--y);
		in[y]=true;
	}
	for(int i =0;i <m;i++){
		if(!in[i])dfs(i);
	}
	for(int i =m-1;i >=0;i--){
		cout <<ord[i]+1<<endl;
	}
	return 0;
}