Problem: Problem

Chieno and Cacao are sisters who work in the same coffee shop. The two are very close, and one day they decided to play a table game.

The game uses the board of R square x C square and the rabbit TP as a piece. Each square on the board is painted white or black. First, place the TP in the lower right corner (R, C) of the board, and the two perform the following actions alternately. Assuming that the current position of TP is (a, b), one jumpable position (i, j) is selected from there, and TP is made to jump there. The positions (i, j) where TP can jump satisfy all of the following.

1. 1 ≤ i ≤ R and 1 ≤ j ≤ C and i ≤ a and j ≤ b and 1 ≤ (a-i) + (b-j) ≤ K
2. (i, j) is a white square



If you can no longer jump TP on your turn, you lose.

Chieno is on the play and Cacao is on the play. Cacao can look ahead to the end of the game in his head and always behaves optimally. At this time, determine if there is a way for Chieno to win.

Constraints

* 1 ≤ R, C ≤ 1000
* 1 ≤ K ≤ 2000
* GR and C are “.”

Input

The input is given in the following format.


R C K
G1,1 G1,2 ... G1,C
G2,1 G2,2 ... G2, C
::
GR, 1 GR, 2 ... GR, C


The first line is given three integers R, C, K separated by blanks. C "." Or "#" are given as board information in the next R line. Gi, j represents the color of the board position (i, j), "." Represents white, and "#" represents black.

Output

Print "Chieno" if there is a way for Chieno to win, or "Cacao" if it doesn't.

Examples

Input

3 3 2
...
...
...


Output

Chieno


Input

3 3 2
.#
.#.
..


Output

Cacao

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

int r,c,k;
int fie[1005][1005];
PP p[1000005];
int dp[1005][1005];
int maxi[1005][1005];

int main(void){
	scanf("%d%d%d",&r,&c,&k);
	for(int i=0;i<r;i++){
		string s;
		cin >> s;
		for(int j=0;j<c;j++){
			if(s[j]=='#'){
				fie[i][j]=1;
			}
			p[i*c+j]=PP(i+j,P(i,j));
		}
	}
	sort(p,p+r*c);
	queue<P> que;
	for(int i=0;i<r*c;i++){
		que.push(p[i].second);
	}
	memset(maxi,-1,sizeof(maxi));
	while(que.size()){
		P p=que.front();
		que.pop();
		int x=p.second,y=p.first;
		if(x>0){
			maxi[y][x]=max(maxi[y][x],maxi[y][x-1]);
		}
		if(y>0){
			maxi[y][x]=max(maxi[y][x],maxi[y-1][x]-1);
		}
		if(fie[y][x]==1)continue;
		if(x<=maxi[y][x]){
			dp[y][x]=1;
		}else{
			dp[y][x]=0;
			maxi[y][x]=x+k;
		}
	}
	for(int i=0;i<r;i++){
		for(int j=0;j<c;j++){
			//printf("%d ",dp[i][j]);
		}
		//printf("\n");
	}
	printf("%s\n",dp[r-1][c-1]==1?"Chieno":"Cacao");
	return 0;
}