#include <iostream>

#include <fstream>

#include <string>

#include <string.h>

#include <vector>

#include <algorithm>

#include <stack>

#include <map>

using namespace std;

ofstream fout("castle.out");

ifstream fin ("castle.in");

const int INF = 999999999;

typedef pair<int, int> pii;

typedef vector<int> vi;

#define all(c) (c).begin(), (c).end()

#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)

const int MAXN = 51;

int g[MAXN][MAXN];

int N,M;

bool vis[MAXN][MAXN];

int dir[4][2] = {{0,-1},{-1,0},{0,1},{1,0}};

int dfs(int x,int y, int num){

}

void work(){

}

int main(){

}