#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

const int BLACK = 0;
const int WHITE = 1;
int n, m, p;
int h[10][10];
int board[10][10][10];

int dx[] = {1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1};
int dy[] = {0, 1, 0, 0, 0, 1,-1, 1, 1, 1, 1,-1,-1};
int dz[] = {0, 0, 1, 1,-1, 0, 0, 1,-1, 1,-1, 1,-1};

void add_ball(int x, int y, int col) {
    int t = h[x][y];
    board[x][y][t] = col;
    h[x][y]++;
}

bool check(int col) {
    rep(x,0,n) rep(y,0,n) rep(z,0,n) {
        rep(i,0,13) {
            int nx = x, ny = y, nz = z;
            int cnt = 0;
            while(1) {
                // printf("dir = %lld, nx = %lld, ny = %lld, nz = %lld\n", i, nx, ny, nz);
                if(nx < 0 || nx >= n || ny < 0 || ny >= n || nz < 0 || nz >= n) break;
                if(board[nx][ny][nz] == col) cnt++;
                else break;
                if(cnt >= m) return true;
                nx += dx[i], ny += dy[i], nz += dz[i];
            }
        }
    }
    return false;
}

signed main() {
    while(cin >> n >> m >> p, n || m || p) {
        memset(h, 0, sizeof(h));
        memset(board, -1, sizeof(board));
        int col = BLACK, winner = -1, turn = INF;
        rep(i,0,p) {
            int x, y; cin >> x >> y;
            x--; y--;
            add_ball(x, y, col);
            if(check(col) && winner == -1) winner = col, turn = i+1;
            col ^= 1;
        }
        if(winner == -1) cout << "Draw" << endl;
        else {
            if(winner == WHITE) printf("White %lld\n", turn);
            else printf("Black %lld\n", turn);
        }
    }
    return 0;
}

Measured memory_bytes: 3128