#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
  
using namespace std;

#define pi 3.141592653589793

bool isfinish(char p[8][8][8], int n, int m, int z[8][8], int x, int y)
{
	int dx[13] = {1, 0, 0, 1, 1, 0, 0, 1, -1, 1, 1, -1, 1};
	int dy[13] = {0, 1, 0, 1, -1, 1, 1, 0, 0, 1, 1, 1, -1};
	int dz[13] = {0, 0, 1, 0, 0, 1, -1, 1, 1, 1, -1, 1, 1};
	for(int i = 0; i < 13; i++){
		int ballnum = 1;
		int nx = x + dx[i], ny = y + dy[i], nz = z[x][y] - 1 + dz[i];
		char c = p[x][y][z[x][y] - 1];
		while(nx > 0 && ny > 0 && nz > 0 && nx <= n && ny <= n && nz <= z[nx][ny] - 1 && c == p[nx][ny][nz]){
			ballnum++;
			nx += dx[i];
			ny += dy[i];
			nz += dz[i];
		}
		nx = x - dx[i];
		ny = y - dy[i];
		nz = z[x][y] - 1 - dz[i];
		while(nx > 0 && ny > 0 && nz > 0 && nx <= n && ny <= n && nz <= z[nx][ny] - 1 && c == p[nx][ny][nz]){
			ballnum++;
			nx -= dx[i];
			ny -= dy[i];
			nz -= dz[i];
		}
		// cout << ballnum << endl;
		if(ballnum >= m) return true;
	}
	return false;
}

int main()
{
	int n, m, p;
	while(1){
		cin >> n >> m >> p;
		if(n == 0 && m == 0 && p == 0) break;
		char puzzle[8][8][8];
		int height[8][8];
		for(int i = 1; i < n + 1; i++){
			for(int j = 1; j < n + 1; j++){
				height[i][j] = 1;
				for(int k = 1; k < n + 1; k++){
					puzzle[i][j][k] = 'n';
				}
			}
		}
		// height[i][j]: (x, y) = (i, j)の現在の高さ、次に玉が置かれる位置
		int x, y;
		int ans = -1;
		for(int i = 0; i < p; i++){
			cin >> x >> y;
			if(ans != -1) continue;
			if(i % 2 == 0) puzzle[x][y][height[x][y]] = 'b';
			else puzzle[x][y][height[x][y]] = 'w';
			height[x][y]++;
			if(p < 2 * (m - 1) + 1) continue;
			if(isfinish(puzzle, n, m, height, x, y)) ans = i + 1;
		}
		if(ans == -1) cout << "Draw" << endl;
		else if(ans % 2 == 1) cout << "Black" << " " << ans << endl;
		else cout << "White" << " " << ans << endl;
	}
	return 0;
}