#include <bits/stdc++.h>
using namespace std;

const int MOD = 998244353;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
    int res = 1;
    while (n) {
        if (n % 2 == 0) {
            x = mul(x, x);
            n /= 2;
        } else {
            res = mul(res, x);
            --n;
        }
    }
    return res;
}

const int MAXF = 1e3;
int fact[MAXF], invf[MAXF];

int C(int n, int k) {
    if (k < 0 || k > n) return 0;
    return mul(fact[n], mul(invf[k], invf[n - k]));
}

const int MAXN = 310;
int seg[MAXN][MAXN];
int dp[MAXN][MAXN];
int used[MAXN];

void solve_() {
    int n, m;
    string s;
    cin >> n >> m;
    cin >> s;
    vector<int> c = {0};
    for (char ch : s) {
        if (ch == '-') {
            int x = c.back();
            c.pop_back();
            c.back() += x;
        } else {
            c.push_back(1);
        }
    }
    vector<int> pref(n - m + 1);
    pref[0] = c[0];
    for (int i = 1; i <= n - m; ++i) {
        pref[i] = pref[i - 1] + c[i];
    }

    auto get_len = [&](int l, int r) {
        return pref[r] - pref[l] - (r - l - 1);
    };

    for (int l = 0; l < n - m; ++l) {
        seg[l][l + 1] = 1;
    }
    for (int len = 2; len <= n - m; ++len) {
        for (int l = 0; l + len <= n - m; ++l) {
            int r = l + len;
            for (int m = l + 1; m < r; ++m) {
                seg[l][r] = add(seg[l][r], mul(seg[l][m], mul(seg[m][r], mul(get_len(m, r), C(r - l - 2, r - m - 1)))));
            }
        }
    }
    for (int i = 0; i < m; ++i) {
        int x;
        cin >> x;
        used[x] = 1;
    }
    dp[0][n - m] = 1;
    int fs = m;
    for (int s = 1; s <= n; ++s) {
        fs -= used[s];
        for (int k = 0; k <= n - m; ++k) {
            int curc0 = pref[k] - k - fs;
            int other = n - s - k - fs;
            if (curc0 < 0 || other < 0) continue;
            if (other != 0 && other >= n - m - k) continue;
            if (used[s]) {
                dp[s][k] = mul(dp[s - 1][k], curc0);
                continue;
            }
            dp[s][k] = dp[s - 1][k];
            for (int k1 = k + 1; k1 <= n - m; ++k1) {
                dp[s][k] = add(dp[s][k], mul(dp[s - 1][k1], mul(seg[k][k1], mul(get_len(k, k1), C(other, k1 - k - 1)))));
            }
        }
    }
    cout << dp[n][0] << "\n";
}

/// #define MULTITEST

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    fact[0] = 1;
    for (int i = 1; i < MAXF; ++i) {
        fact[i] = mul(fact[i - 1], i);
    }
    invf[MAXF - 1] = pw(fact[MAXF - 1], MOD - 2);
    for (int i = MAXF - 1; i > 0; --i) {
        invf[i - 1] = mul(invf[i], i);
    }

    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}