#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <cassert>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
const double PI = acos(-1);
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()
typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
    L(const P& a, const P& b){ at(0)=a; at(1)=b; }
    L(){}
};
struct C{
    P p;
    double r;
    C(const P& p, const double& r) : p(p), r(r) {}
    C(){}
};

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

double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}
int ccw(P a, P b, P c){
    b -= a;
    c -= a;
    if(cross(b,c) > EPS) return +1; //ccw
    if(cross(b,c) < -EPS) return -1; //cw
    if(dot(b,c) < -EPS) return +2; //c-a-b
    if(abs(c)-abs(b) > EPS) return -2; //a-b-c
    return 0; //a-c-b
}
P unit(const P &p){
    return p/abs(p);
}
P rotate(const P &p, double rad){
    return p *P(cos(rad), sin(rad));
}

bool intersectSS(const L& a, const L& b){
    return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&
        ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );
}
bool intersectSP(const L& s, const P &p){
    return abs(cross(s[0]-p, s[1]-p))<EPS  && dot(s[0]-p, s[1]-p)<EPS;
}

P projection(const L& l, const P& p) {
    double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);
    return l[0] + t*(l[0]-l[1]);
}
double distanceLP(const L &l, const P &p) {
    return abs(cross(l[1]-l[0], p-l[0])) /abs(l[1]-l[0]);
}

P crosspointLL(const L &l, const L &m) {
  double A = cross(l[1]-l[0], m[1]-m[0]);
  double B = cross(l[1]-l[0], l[1]-m[0]);
  return m[0] + B/A *(m[1]-m[0]);
}

VP crosspointCL(const C &c, const L &l){
    VP ret;
    P mid = projection(l, c.p);
    double d = distanceLP(l, c.p);
    if(EQ(d, c.r)){
        ret.push_back(mid);
    }else if(d < c.r){
        double len = sqrt(c.r*c.r -d*d);
        ret.push_back(mid +len*unit(l[1]-l[0]));
        ret.push_back(mid -len*unit(l[1]-l[0]));
    }
    return ret;
}
VP crosspointCS(const C &c, const L &s){
    VP ret;
    VP cp = crosspointCL(c,s);
    for(int i=0; i<(int)cp.size(); i++){
        if(intersectSP(s, cp[i])){
            ret.push_back(cp[i]);
        }
    }
    return ret;
}

int main(){
    int n,a,b;
    cin >> n >> a >> b;
    VP p(n);
    for(int i=0; i<n; i++){
        int x,y;
        cin >> x >> y;
        p[i] = P(x, y);
    }
    vector<L> fl(n-1);
    for(int i=0; i<n-1; i++){
        fl[i] = L(p[i], p[i+1]);
    }

    VP sq(4);
    int cidx = 1; //回転の中心になる頂点
    int fidx = -1; //回転の中心が接している床(ちょうど間の場合は後ろ)
    for(int i=0; i<n-1; i++){
        if(p[i+1].X > a +EPS){
            sq[0] = crosspointLL(fl[i], L(P(a, 0), P(a, 1)));
            P dir = unit(p[i+1] -p[i]);
            sq[1] = sq[0] +dir;
            sq[2] = sq[1] +dir*P(0, 1);
            sq[3] = sq[0] +dir*P(0, 1);
            fidx = i;
            break;
        }
    }
    assert(fidx != -1);
    
    while(sq[cidx].X +EPS < b || !intersectSP(fl[fidx], sq[(cidx-1+4)%4])){
        if(intersectSP(fl[fidx], sq[(cidx+1)%4])){
            cidx = (cidx +1)%4;
            continue;
        }
        C c[2] = {C(sq[cidx], 1), C(sq[cidx], sqrt(2))};
        P cp[2] = {sq[(cidx+1)%4], sq[(cidx+2)%4]};
        double maxarg[2] = {-PI, -PI};
        int nfidx[2] = {-1, -1};
        for(int d=0; d<2; d++){
            for(int i=fidx; i<n-1; i++){
                VP ret = crosspointCS(c[d], fl[i]);
                for(P point: ret){
                    P curr = sq[(cidx+1+d)%4] -sq[cidx];
                    P next = point -sq[cidx];
                    double angle = arg(next/curr);
                    if(angle > -EPS) continue;
                    if(angle +EPS > maxarg[d]){
                        maxarg[d] = angle;
                        cp[d] = point;
                        nfidx[d] = i;
                    }
                }
            }
        }
        int d = (maxarg[0] > maxarg[1])? 0: 1;
        for(int i=1; i<4; i++){
            sq[(cidx+i)%4] = sq[cidx] +rotate(sq[(cidx+i)%4] -sq[cidx], maxarg[d]);
        }
        cidx = (cidx +1 +d) %4;
        fidx = nfidx[d];
    }
    string ans[4] = {"Blue", "White", "Red", "Green"};
    cout << ans[(cidx+1)%4] << endl;
    return 0;
}


Measured memory_bytes: 3668