#define dfs() inline void dfs(int now,int sum)\
{\
	if(sum>p) return ;\
	if(now>n)\
	{\
		if(s==p)\
		{\
			for(int i=1;i<=n;i++) write(a[i]),putchar(' ');\
			exit(0);\
		}\
		return ;\
	}\
	for(int i=1;i<=n;i++)\
	{\
		if(used[i]) continue;\
		used[i]=1;\
		a[now]=i;\
		dfs(now+1,sum+i*f[n][now]);\
		used[i]=0;\
	}\
}

参数now和sum调用时咋整