#include <bits/stdc++.h>
using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;

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

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    while (true) {
        int m, n, p; cin >> n >> m >> p;
        if (m == 0) {
            break;
        }

        auto board = make_v<int>(n,n,n);

        int winner = 0, end = -1;

        for (int i = 0; i < p; ++i) {
            int stone = (i & 1 ? -1 : 1);
            int x, y; cin >> x >> y;
            --x, --y;

            if (winner != 0) {
                continue;
            }

            int z = -1;
            for (int _z = 0; _z < n; ++_z) {
                if (board[_z][y][x] == 0) {
                    z = _z;
                    break;
                }
            }
            assert(z != -1);

            board[z][y][x] = stone;

            for (int k = 0; k < 13; ++k) {
                int len = 1;
                for (int t = 1; ; ++t) {
                    int X = x + dx[k] * t,
                        Y = y + dy[k] * t,
                        Z = z + dz[k] * t;
                    if (X < 0 || X >= n ||
                        Y < 0 || Y >= n ||
                        Z < 0 || Z >= n) {
                        break;
                    }
                    if (board[Z][Y][X] == stone) {
                        ++len;
                    } else {
                        break;
                    }
                }
                for (int t = -1; ; --t) {
                    int X = x + dx[k] * t,
                        Y = y + dy[k] * t,
                        Z = z + dz[k] * t;
                    if (X < 0 || X >= n ||
                        Y < 0 || Y >= n ||
                        Z < 0 || Z >= n) {
                        break;
                    }
                    if (board[Z][Y][X] == stone) {
                        ++len;
                    } else {
                        break;
                    }
                }

                if (len >= m) {
                    winner = stone;
                    end = i+1;
                    break;
                }
            }
        }

        if (winner != 0) {
            cout << (winner == 1 ? "Black " : "White ") << end << endl;
        } else {
            cout << "Draw" << endl;
        }
    }

    return 0;
}



Measured memory_bytes: 3156