#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int subtaskId;
int N;
char A[210], B[210], S[210];

bool mem[62][62][62];
unsigned cache[62][62][62];
unsigned dp[62][62][62];

// a-c <= x && b-a <= y && c-b <= z  anytime
unsigned solve(int x, int y, int z) {
  if (!(x >= 0 && y >= 0 && z >= 0)) return 0;
  unsigned &ret = cache[x][y][z];
  if (!mem[x][y][z]) {
    for (int a = 0; a <= N; ++a) for (int b = 0; b <= N; ++b) for (int c = 0; c <= N; ++c) dp[a][b][c] = 0;
    dp[0][0][0] = 1;
    for (int a = 0; a <= N; ++a) for (int b = 0; b <= min(N, a + y); ++b) for (int c = max(0, a - x); c <= min(N, b + z); ++c) if (dp[a][b][c]) {
      const int i = a + b + c;
      if (S[i] == '?' || S[i] == 'A') dp[a + 1][b][c] += dp[a][b][c];
      if (S[i] == '?' || S[i] == 'B') dp[a][b + 1][c] += dp[a][b][c];
      if (S[i] == '?' || S[i] == 'C') dp[a][b][c + 1] += dp[a][b][c];
    }
    ret = dp[N][N][N];
    mem[x][y][z] = true;
  }
  return ret;
}

int main() {
  for (int numCases; ~scanf("%d%d", &numCases, &subtaskId); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    scanf("%s", A);
    scanf("%s", B);
    scanf("%s", S);
    
    if (caseId == numCases) {
      vector<int> xs(N + 2, N + 1), ys(N + 2, N + 1);
      for (int x = N; x >= 0; --x) xs[x] = (A[x] == '1') ? x : xs[x + 1];
      for (int y = N; y >= 0; --y) ys[y] = (B[y] == '1') ? y : ys[y + 1];
      for (int x = 0; x <= N; ++x) for (int y = 0; x + y <= N; ++y) for (int z = 0; x + y + z <= N; ++z) mem[x][y][z] = false;
      unsigned ans = 0;
      for (int x = 0; x <= N; ++x) for (int y = 0; x + y <= N; ++y) if (xs[x] <= N && ys[y] <= N) {
        const int z = N - xs[x] - ys[y];
        unsigned here = 0;
        here += solve(x, y, z);
        here -= solve(x, y - 1, z);
        here -= solve(x - 1, y, z);
        here += solve(x - 1, y - 1, z);
// if(here)cerr<<x<<" "<<y<<": "<<here<<endl;
        ans += here;
      }
      printf("%u\n", ans);
    } else {
      puts("-1");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}