#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T>inline bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>inline bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

int px[400], py[400];
int field[15][15][15];
int nowz[15][15];
const int dx[] = {0, 1, -1};
const int dy[] = {0, 1, -1};
const int dz[] = {0, 1, -1};


bool inside(int n, int x, int y, int z) {
    return 0 <= x && x < n && 0 <= y && y < n && 0 <= z && z < n;
}

bool check(int n, int m) {
    REP(i, n) REP(j, n) REP(k, n) if (field[i][j][k] != -1) {
        int state = field[i][j][k];
        REP(xp, 3) REP(yp, 3) FOR(zp, (xp == 0 && yp == 0), 3) {
            int x = i, y = j, z = k;
            bool ok = true;
            REP(_, m - 1) {
                x += dx[xp]; y += dy[yp]; z += dz[zp];
                if (!inside(n, x, y, z)) {
                    ok = false;
                    break;
                }
                if (field[x][y][z] != state) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                return true;
            }
        }
    }
    return false;
}

void solve(int n, int m, int p) {
    REP(i, 15) REP(j, 15) {
        REP(k, 15) field[i][j][k] = -1;
        nowz[i][j] = n;
    }
    REP(i, p) {
        scanf("%d%d", px + i, py + i);
        px[i]--;py[i]--;
    }
    int win = -1;
    REP(i, p) {
        int st = i % 2;
        field[px[i]][py[i]][--nowz[px[i]][py[i]]] = st;
        if (check(n, m)) {
            win = i + 1;
            break;
        }
    }
    if (win == -1) {
        puts("Draw");
    } else if (win % 2) {
        printf("Black %d\n", win);
    } else {
        printf("White %d\n", win);
    }
}

int main(void) {
	int a, b, c, x, y, z, n, m, p;
	string s;
	while (cin >> n >> m >> p, n) {
		solve(n, m, p);
		//break;
	}
}

Measured memory_bytes: 3108