// Skyqwq
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

typedef long long LL;

const int N = 205, P = 1e9 + 7;

int n, K, out[N], in[N], fact[N], infact[N], f[N], sum;

char s[N], g[N][N];

void inline clear() {
    for (int i = 1; i <= n; i++) out[i] = 0, in[i] = 0, f[i] = 0;
}

int inline power(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = (LL)res * a % P;
        a = (LL)a * a % P;
        b >>= 1;
    }
    return res;
}

void inline factPrework(int n) {
    fact[0] = infact[0] = 1;
    for (int i = 1; i <= n; i++) fact[i] = (LL)fact[i - 1] * i % P;
    infact[n] = power(fact[n], P - 2);
    for (int i = n - 1; i; i--) infact[i] = infact[i + 1] * (i + 1ll) % P;
}

int inline C(int a, int b) {
    if (a < b) return 0;
    return (LL)fact[a] * infact[b] % P * infact[a - b] % P;
}

int inline ask() {
    int ans = 1;
    for (int i = 1; i <= n; i++) {
        int A = out[i], B = in[i], t = min(A, B);
        ans = (LL)ans * fact[t] % P;
    }
    return ans;
}

namespace S2{
    void inline work() {
        clear();
        for (int i = 1; i <= n; i++) {
            if (s[i] == 'S') in[i]++;
            else if (s[i] == 'R') out[i]++;
        }
        int S, T;
        for (int i = 1; i <= n; i++) 
            for (int j = 1; j <= n; j++)
                if (g[i][j] == '1') {
                    if (i < j) 
                        in[j]++, out[i]++;
                    else S = j, T = i;
                }
        //in[S]++, out[T]++;
        int ans = 1;
        for (int i = 1; i < S; i++) ans = (LL)ans * fact[in[i]] % P;
        for (int i = T; i <= n; i++) ans = (LL)ans * fact[out[i]] % P;
        f[S] = 1;
        for (int i = S; i < T; i++) {
            for (int j = i + 1; j <= T; j++) {
                if (g[i][j] == '1') {
                    int v = (LL)f[i] * fact[out[i] - 1] % P;
                    for (int k = i + 1; k < j; k++)
                        v = (LL)v * fact[out[k]] % P;
                    (f[j] += v) %= P;
                }
            }
        }
        ans = (LL)ans * f[T] % P;
        printf("%d\n", (sum - ans + P) % P);
    }
}

void inline add(int &x, int y) {
    (x += y) %= P;
}

namespace S3{
    int F[N][N], G[N][N];
    void inline work() {
        clear();
        for (int i = 1; i <= n; i++) {
            if (s[i] == 'S') in[i]++;
            else if (s[i] == 'R') out[i]++;
        }
        int S1 = -1, T1, S2, T2;
        for (int i = 1; i <= n; i++) 
            for (int j = 1; j <= n; j++)
                if (g[i][j] == '1') {
                    if (i < j) 
                        in[j]++, out[i]++;
                    else if (S1 == -1) S1 = j, T1 = i;
                    else S2 = j, T2 = i;
                }
        memset(F, 0, sizeof F);
        memset(G, 0, sizeof G);
        //cout << S1 << " ddd" << T1 << " )) " << " " << S2 << " " << T2 << endl;
        F[S1][S2] = 1;
        for (int i = 1; i <= n; i++) {
            memcpy(G, F, sizeof G);
            memset(F, 0, sizeof F);
            for (int u = 1; u <= n; u++) {
                for (int v = 1; v <= n; v++) {
                    if (!G[u][v]) continue;
                    //cout << u << " " << v << " -> " << G[u][v] << endl;
                    add(F[u][v], (LL)G[u][v] * fact[in[i]] % P);
                    if (u < i && g[u][i] == '1') {
                        add(F[i][v], (LL)G[u][v] * fact[in[i] - 1] % P);
                    }
                    if (v < i && g[v][i] == '1') {
                        add(F[u][i], (LL)G[u][v] * fact[in[i] - 1] % P);
                    }
                    if (u != v && u < i && v < i && g[u][i] == '1' && g[v][i] == '1') {
                        add(F[i][i], (LL)G[u][v] * fact[in[i] - 2] % P);
                    }
                }
            }
            //cout << i << " ____________\n";
        }
        int ans = 0;
        for (int u = 1; u <= n; u++) {
            for (int v = 1; v <= n; v++) {
                if (!F[u][v]) continue;
                    //cout << u << " " << v << " -> " << F[u][v] << endl;
                if (u != v && s[u] == 'R' && s[v] == 'R') add(ans, F[u][v]);
                if (u == T2 && s[v] == 'R') add(ans, F[u][v]);
                if (v == T1 && s[u] == 'R') add(ans, F[u][v]);
            }
        }
        printf("%d\n", ans);
    }
}

int main() {
    factPrework(200);
    int T; scanf("%d", &T);
    while (T--) {
        scanf("%d%d%s", &n, &K, s + 1);
        for (int i = 1; i <= n; i++) {
            scanf("%s", g[i] + 1);
            if (s[i] == 'S') in[i]++;
            else if (s[i] == 'R') out[i]++;
        }
        for (int i = 1; i <= n; i++) 
            for (int j = 1; j <= n; j++)
                if (g[i][j] == '1') {
                        in[j]++, out[i]++;
                }
        sum = ask();
        if (K == 0) {
            printf("%d\n", sum);
        } else if (K == 1) {
            S2::work();
        } else {
            S3::work();
        }
        clear();
    }
    return 0;
}