#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>using namespace std;const int maxn=362880+10;int ans[9];
int level[9];
int a[maxn][9];
int que[maxn],rec[maxn],pre[maxn];
int Hash[maxn];int get_h(int a[]){int sum=0,cnt;for(int i=0;i<9;i++){cnt=0;for(int j=i+1;j<9;j++)if(a[j]<a[i]) cnt++;sum+=cnt*level[8-i];}return sum;
}void change1(int L[],int N[]){N[0]=L[3],N[1]=L[0],N[2]=L[1];N[3]=L[6],N[4]=L[4],N[5]=L[2];N[6]=L[7],N[7]=L[8],N[8]=L[5];
}void change2(int L[],int N[]){N[0]=L[0],N[1]=L[1],N[2]=L[2];N[3]=L[5],N[4]=L[3],N[5]=L[4];N[6]=L[6],N[7]=L[7],N[8]=L[8];
}void print(int a[]){printf("%d %d %d\n%d %d %d\n%d %d %d\n\n",a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8]);
}void dfs(int p){if(!p) return;dfs(pre[p]);print(a[p]);
}void BFS(){int H=0,T=2,key;pre[1]=0;key=get_h(a[1]);Hash[key]=1;que[1]=key;while(H+1<T){H++;change1(a[H],a[T]);key=get_h(a[T]);if(!Hash[key]){Hash[key]=Hash[que[H]]+1,que[T]=key,rec[key]=T,pre[T]=H,T++;if(!key){int p=T-1;printf("%d\n",Hash[0]-1);dfs(p);return ;}}change2(a[H],a[T]);key=get_h(a[T]);if(!Hash[key]){Hash[key]=Hash[que[H]]+1,que[T]=key,rec[key]=T,pre[T]=H,T++;if(!key){int p=T-1;printf("%d\n",Hash[0]-1);dfs(p);return ;}}}printf("UNSOLVABLE");
}int main(){freopen("num9.in","r",stdin);freopen("num9.out","w",stdout);level[0]=1;for(int i=1;i<=9;i++) level[i]=level[i-1]*i;for(int i=0;i<9;i++)scanf("%d",&a[1][i]);BFS();return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>using namespace std;const int maxn=210;
const int INF=0x7fffffff;int n;
int ans;struct Node{int a,b;
}s[maxn];bool cmp(const Node &A,const Node &B){return A.b>B.b;
}int sum[maxn];
int f[maxn][maxn*maxn];int main(){freopen("lunch.in","r",stdin);freopen("lunch.out","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d%d",&s[i].a,&s[i].b);sort(s+1,s+n+1,cmp);for(int i=1;i<=n;i++)sum[i]=sum[i-1]+s[i].a;memset(f,0x7f,sizeof(f));f[0][0]=0;for(int i=1;i<=n;i++)for(int j=0;j<=sum[i-1];j++){f[i][j]=min(f[i][j],max(f[i-1][j],sum[i-1]-j+s[i].a+s[i].b));f[i][j+s[i].a]=min(f[i][j+s[i].a],max(f[i-1][j],j+s[i].a+s[i].b));}ans=INF;for(int i=0;i<=sum[n];i++)ans=min(ans,f[n][i]);printf("%d",ans);return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>using namespace std;const int maxn=510;typedef int array[maxn][maxn];
array map, pam;int t,n,m;
int link[maxn*maxn];void newarc(int x,int y){if(x<y)link[x]=y,link[y]=-1;elselink[y]=x,link[x]=-1;
}bool check(int n,int m,array &map,int x){int i,j,top,stack[maxn*maxn];memset(link,0,sizeof(link));for(int i=1;i<n;i++)if((i&1) == x)for(int j=1;j<=m;j++)newarc(map[i][j],map[i+1][j]);top=0;for(int i=1;i<=t;i++){if(link[i]>0)stack[++top]=link[i];else if(link[i]<0){if(stack[top]!=i) return false;top--;};}return true;
}int main(){freopen("foldgirl.in","r",stdin);freopen("foldgirl.out","w",stdout);int kase;scanf("%d",&kase);while(kase--){scanf("%d%d",&n,&m);t=n*m;for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)scanf("%d",&map[i][j]),pam[j][i]=map[i][j];if(check(n,m,map,0) && check(n,m,map,1) && check(m,n,pam,0) && check(m,n,pam,1))puts("AllRight");elseputs("Cheat");}return 0;
}