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

/// modinv
/// 逆元
/// Input   : n
/// Option  : mod 余りを取る値 デフォルトは998244353
/// Output  : nの逆元
/// Order   : log n
/// Verified:

template<typename T>
T modinv(T n, T mod=998244353) {
  T m = mod, u = 1, v = 0;
  while (m) {
      long long t = n / m;
      n -= t * m; swap(n, m);
      u -= t * v; swap(u, v);
  }
  u %= mod;
  if (u < 0) u += mod;
  return u;
}

int main() {
  lint p, n;
  cin >> p >> n;
  vector<lint> vec(n);
  for (int i = 0; i < n; i++) cin >> vec[i];
  lint ans = vec[0];
  string s;
  cin >> s;
  for (int i = 0; i+1 < n; i++) {
    if (s[i] == '+') ans = (ans+vec[i+1])%p;
    if (s[i] == '-') ans = (ans-vec[i+1]+p)%p;
    if (s[i] == '*') ans = (ans*vec[i+1])%p;
    if (s[i] == '/') ans = (ans*modinv(vec[i+1], p))%p;
  }
  cout << ans << endl;
}