#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

int T;
int n, m, W, L;
char seal[2010][2010];
namespace testpoint1to4
{
  struct DoubleArray
  {
    int a[110][110];
  };
  int cnt;
  int main()
  {
    DoubleArray a;
    memset(a.a, 0, sizeof a.a);
    for (int x = 1; x <= W - n + 1; x++)
      for (int y = 1; y <= L - m + 1; y++)
        for (int i = x; i <= x + n - 1; i++)
          for (int j = y; j <= y + m - 1; j++)
            if (seal[i - x + 1][j - y + 1] == '#')
              a.a[i][j] = 1;
    cnt = 0;
    for (int i = 1; i <= W; i++)
      for (int j = 1; j <= L; j++)
        cnt += a.a[i][j];
    cout << cnt << '\n';
    return 0;
  }
}
namespace testpoint5to6
{
  int main()
  {
    int cnt1 = 0, cnt2 = 0;
    int i = m;
    while (seal[1][m - (cnt1++)] != '#')
      ;
    cnt1--;
    while (seal[1][++cnt2] != '#')
      ;
    cnt2--;
    int t = L - m;
    for (int i = 1; i <= t; i++)
    {
      for (int j = 2; j <= m; j++)
        if (seal[1][j - 1] == '#')
          seal[1][j] = '$';
      for (int j = 2; j <= m; j++)
        if (seal[1][j] == '$')
          seal[1][j] = '#';
    }
    int cnt3 = 0;
    for (int i = cnt2 + 1; i <= m - cnt1; i++)
      if (seal[1][i] == '.')
        cnt3++;
    cout << L - cnt1 - cnt2 - cnt3 << '\n';
    return 0;
  }
}
namespace testpoint7to8
{
  int main()
  {
    int cnt1 = 0, cnt2 = 0;
    int i = m;
    while (seal[1][m - (cnt1++)] != '#')
      ;
    cnt1--;
    while (seal[1][++cnt2] != '#')
      ;
    cnt2--;
    int t = L - m;
    for (int i = 1; i <= t; i++)
    {
      for (int j = 2; j <= m; j++)
        if (seal[1][j - 1] == '#')
          seal[1][j] = '$';
      for (int j = 2; j <= m; j++)
        if (seal[1][j] == '$')
          seal[1][j] = '#';
    }
    int cnt3 = 0;
    for (int i = cnt2 + 1; i <= m - cnt1; i++)
      if (seal[1][i] == '.')
        cnt3++;
    cout << (L - cnt1 - cnt2 - cnt3) * W << '\n';
    return 0;
  }
}

int solve()
{
  cin >> W >> L >> n >> m;
  for (int i = 1; i <= n; i++)
    cin >> (seal[i] + 1);
  if (W <= 100 && L <= 100)
    return testpoint1to4::main();
  if (W == 1 && n == 1)
    return testpoint5to6::main();
  if (W == 1)
    return testpoint7to8::main();
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> T;
  while (T--)
    solve();
  return 0;
}