#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")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;

constexpr int LIM = 310;
Mint bn[LIM][LIM];


int N, M;
char S[610];
vector<int> A;

Mint sub[310][310];

int main() {
  for (int n = 0; n < LIM; ++n) {
    bn[n][0] = bn[n][n] = 1;
    for (int k = 1; k < n; ++k) bn[n][k] = bn[n - 1][k - 1] + bn[n - 1][k];
  }
  
  for (; ~scanf("%d%d", &N, &M); ) {
    scanf("%s", S + 1);
    A.resize(M);
    for (int m = 0; m < M; ++m) {
      scanf("%d", &A[m]);
    }
    
    vector<int> X;
    X.push_back(0);
    for (int x = 1; x <= N + M; ++x) if (S[x] == '-') X.push_back(x);
    const int len = (int)X.size() - 1;
    
    /*
      sub[l][r]
        keep X[l] vacant
        use X[l+1], ..., X[r] in some order
    */
    for (int l = len; l >= 0; --l) for (int r = l; r <= len; ++r) {
      if (l == r) {
        sub[l][r] = 1;
      } else {
        sub[l][r] = 0;
        for (int m = l + 1; m <= r; ++m) {
          // use X[m] last
          sub[l][r] += bn[r - l - 1][m - l - 1] * sub[l][m - 1] * sub[m][r] * ((X[m] - X[l] - 1) - 2 * (m - l - 1));
        }
// cerr<<"sub["<<l<<"]["<<r<<"] = "<<sub[l][r]<<endl;
      }
    }
    
    vector<int> inA(N + 1, 0);
    for (const int a : A) inA[a] = 1;
    
    /*
      dp[i]
        X[1], ..., X[i-1]: not determined
        X[i]: vacant
        X[i+1], ..., X[len]: used
    */
    vector<Mint> dp(len + 1, 0);
    dp[len] = 1;
    int cnt[2] = {};
    for (int a = 1; a <= N; ++a) {
      if (inA[a]) {
        for (int i = 0; i <= len; ++i) if (dp[i]) {
          for (int j = 0; j < i; ++j) {
            dp[j] += dp[i] * bn[cnt[1] - (len - i)][i - j - 1] * sub[j][i - 1] * ((X[i] - X[j] - 1) - 2 * (i - j - 1));
          }
        }
      } else {
        for (int i = 0; i <= len; ++i) if (dp[i]) {
          dp[i] *= (((N + M) - X[i]) - 2 * (len - i) - cnt[0]);
        }
      }
      ++cnt[inA[a]];
// cerr<<"dp = "<<dp<<endl;
    }
    printf("%u\n", dp[0].x);
  }
  return 0;
}