#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dist(int x, int y){
  return x * x + y * y;
}

int main(){
  int T;
  cin >> T;
  while(T--){
    int N, X, Y;
    cin >> N >> X >> Y;
    int NX, NY;
    cin >> NX >> NY;
    vector<int> BX(N), BY(N);
    REP(i, N) cin >> BX[i] >> BY[i];
    vector< vector<int> > G(N);
    REP(i, N)FOR(j, i + 1, N){
      if(dist(BX[i] - BX[j], BY[i] - BY[j]) <= 50 * 50){
        G[i].push_back(j);
        G[j].push_back(i);
      }
    }
    int ans = 0;
    vector<int> cnt(N);
    queue<int> que[2];
    int T = Y / X + 1;
    REP(i, N) if(dist(BX[i] - NX, BY[i] - NY) <= 10 * 10){
      que[0].push(i);
      cnt[i] = T + 1;
    }
    while(!que[ans & 1].empty()){
      REP(i, N) if(cnt[i] > 0) cnt[i] --;
      //printf("%d:\n", ans);
      while(!que[ans & 1].empty()){
        int u = que[ans & 1].front(); que[ans & 1].pop();
        //printf("%d : %d %d\n", u, BX[u], BY[u]);
        REP(i, G[u].size()){
          int v = G[u][i];
          if(cnt[v] == 0){
            que[(ans + 1) & 1].push(v);
            cnt[v] = T + 1;
          }
        }
      }
      ans ++;
      if(ans >= 100000) break;
    }
    if(ans >= 100000) cout << "You're always welcome!" << endl;
    else cout << ans * X << endl;
  }

  return 0;
}