直接 DFS 搜尋
//====================================================================||
// Name : Coprimes.cpp ||
// Date : 2013/6/5 下午6:43:50 ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int t,s;
int test;
int coprime\[105\]\[105\];
int ans\[40\];
void dfs(int now,int res){
if(now==t-1){
int fg=1;
if(ans\[now-1\]>res)fg=0;
for(int i=0;i<now;i++){
if(!coprime\[ans\[i\]\]\[res\]){
fg=0;
break;
}
}
if(fg){
for(int i=0;i<now;i++){
printf("%d ",ans\[i\]);
}printf("%d\\n",res);
}
}
else if(now==0){
for(int i=1;i<=s;i++){
// if(i>s-i)return;
ans\[now\]=i;
dfs(now+1,s-i);
}
}else{
for(int i=1;i<=res;i++){
int fg=1;
if(ans\[now-1\]>i)fg=0;
if(fg){
for(int j=0;j<now;j++){
if(!coprime\[ans\[j\]\]\[i\]){
fg=0;
break;
}
}
}
if(fg){
ans\[now\]=i;
dfs(now+1,res-i);
}
}
}
}
int gcd(int a,int b){
if(b==0)return a;
else return gcd(b,a%b);
}
void pre(){
for(int i=1;i<105;i++){
for(int j=i;j<105;j++){
if(gcd(i,j)==1){
coprime\[i\]\[j\]=1;
coprime\[j\]\[i\]=1;
}
}
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
Set(coprime,0);
pre();
scanf("%d",&test);
int ff=0;
while(test--){
printf("Case %d:\\n",++ff);
scanf("%d%d",&s,&t);
dfs(0,s);
}
}