#include<cstdio>
#include<vector>
#include<algorithm>
#include<bitset>
using namespace std;
#define BM 50005
typedef vector<int>::iterator it;
int n,m;
bitset<BM>viz;
vector<int>pre[BM];
void af(int i){
	viz[i]=1;
	for(it ii=pre[i].begin();ii!=pre[i].end();++ii)if(!viz[*ii])af(*ii);
	printf("%d ",i);
}
int main () {
	int i,a,b;
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;++i){
		scanf("%d %d",&a,&b);
		pre[b].push_back(a);
	}
	for(i=1;i<=n;++i)if(!viz[i])af(i);
	return 0;
}