#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
ll n; cin >> n;
string s; cin >> s;
s = "$" + s;
vector<ll> a(n+5);
rep1(i,n) cin >> a[i];
ll m = 30*n+5;
ll dp1[m+5][15][15], dp2[m+5][15][15];
memset(dp1,0,sizeof dp1);
memset(dp2,0,sizeof dp2);
if(a[n] != -1){
dp1[a[n]][0][0] = 1;
}
else{
rep(j,m+1){
dp1[j][0][0] = 1;
}
}
ll ptr = 2*n+1;
auto ok = [&](string put, string pat){
assert(sz(put) == sz(pat));
rep(i,sz(put)){
if(pat[i] == '?') conts;
if(put[i] != pat[i]) return false;
}
return true;
};
// final stage
{
string pat = "";
rep(iter,3){
pat.pb(s[ptr--]);
}
reverse(all(pat));
vector<array<ll,3>> possible;
// xxx
if(ok("xxx",pat)){
ll score = 30;
possible.pb({score,10,10});
}
// xxA
rep(A,10){
string curr = "xx"+to_string(A);
if(ok(curr,pat)){
ll score = 20+A;
possible.pb({score,10,10});
}
}
// xA/
rep(A,10){
string curr = "x"+to_string(A)+"/";
if(ok(curr,pat)){
ll score = 20;
possible.pb({score,10,A});
}
}
// xAB
rep(A,10){
rep(B,10){
if(A+B >= 10) break;
string curr = "x"+to_string(A)+to_string(B);
if(ok(curr,pat)){
ll score = 10+A+B;
possible.pb({score,10,A});
}
}
}
// A/x
rep(A,10){
string curr = to_string(A)+"/x";
if(ok(curr,pat)){
ll score = 20;
possible.pb({score,A,10-A});
}
}
// A/B
rep(A,10){
rep(B,10){
string curr = to_string(A)+"/"+to_string(B);
if(ok(curr,pat)){
ll score = 10+B;
possible.pb({score,A,10-A});
}
}
}
// AB-
rep(A,10){
rep(B,10){
if(A+B >= 10) break;
string curr = to_string(A)+to_string(B)+"-";
if(ok(curr,pat)){
ll score = A+B;
possible.pb({score,A,B});
}
}
}
rep(j,m+1){
if(!dp1[j][0][0]) conts;
for(auto [score,x,y] : possible){
if(j >= score){
dp2[j-score][x][y] += dp1[j][0][0];
}
}
}
}
rev(i,n-1,1){
string pat = "";
rep(iter,2){
pat.pb(s[ptr--]);
}
reverse(all(pat));
rep(j,m+1){
rep(x,11){
rep(y,11){
if(a[i] != -1 and a[i] != j){
dp1[j][x][y] = 0;
}
else{
dp1[j][x][y] = dp2[j][x][y];
}
dp2[j][x][y] = 0;
}
}
}
rep(x,11){
rep(y,11){
vector<array<ll,3>> possible;
// x-
if(ok("x-",pat)){
ll score = 10+x+y;
possible.pb({score,10,x});
}
// A/
rep(A,10){
string curr = to_string(A)+"/";
if(ok(curr,pat)){
ll score = 10+x;
possible.pb({score,A,10-A});
}
}
// AB
rep(A,10){
rep(B,10){
if(A+B >= 10) conts;
string curr = to_string(A)+to_string(B);
if(ok(curr,pat)){
ll score = A+B;
possible.pb({score,A,B});
}
}
}
rep(j,m+1){
if(!dp1[j][x][y]) conts;
for(auto [score,x2,y2] : possible){
if(j >= score){
dp2[j-score][x2][y2] += dp1[j][x][y];
}
}
}
}
}
}
ll ans = 0;
rep(x,11){
rep(y,11){
ans += dp2[0][x][y];
}
}
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
