#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <class T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
template <class T>
using V = std::vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<ll, ll>;
using PAIRLL = std::pair<ll, ll>;
constexpr ll INFINT = (1 << 30) - 1;
constexpr ll INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-10;
constexpr ll MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  ll Q;
  MACRO_VAR_Scan(Q);
  ;
  for (ll _ = 0; _ < ll(Q); ++_) {
    ll a, b;
    MACRO_VAR_Scan(a, b);
    ;
    std::string s;
    MACRO_VAR_Scan(s);
    ;
    V<ll> c;
    {
      s += 'X';
      ll now = 0;
      for (ll i = 0; i < ll(s.size()); ++i) {
        if (s[i] == '.') {
          ++now;
        } else {
          if (now >= b) c.emplace_back(now);
          now = 0;
        }
      }
    }
    std::sort((c).begin(), (c).end());
    ll sz = c.size();
    if (sz == 0) {
      std::cout << ("NO");
      std::cout << "\n";
      ;
      continue;
    }
    if ((b <= c[0] && c[0] < a)) {
      std::cout << ("NO");
      std::cout << "\n";
      ;
      continue;
    }
    if (sz >= 2 && c[sz - 2] >= 2 * b) {
      std::cout << ("NO");
      std::cout << "\n";
      ;
      continue;
    }
    bool A = false;
    for (ll i = 0; i < ll(c[sz - 1]); ++i) {
      ll t = c[sz - 1] - a - i;
      if (i > t) break;
      if (t >= 2 * b) continue;
      if ((b <= i && i < a)) continue;
      if ((b <= t && t < a)) continue;
      ll cnt = sz - 1 + (i >= a) + (t >= a);
      if (cnt % 2 == 0) A = true;
    }
    std::cout << (A ? "YES" : "NO");
    std::cout << "\n";
    ;
  }
  return 0;
}
