#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

long long modpow(long long x, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1)
      ret = ret * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return ret;
}

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

  long long p;
  int n;
  cin >> p >> n;
  vector<long long> a(n);
  REP (i, n) {
    cin >> a[i];
    a[i] %= p;
  }

  if (n == 1)
    cout << a[0] << endl;
  else {
    string s;
    cin >> s;
    long long ret = a[0];

    REP (i, s.length()) {
      char c = s[i];
      if (c == '+')
        ret += a[i+1];
      else if (c == '-')
        ret -= a[i+1];
      else if (c == '*')
        ret *= a[i+1];
      else
        ret *= modpow(a[i+1], p-2, p);
      ret = ret % p;
      if (ret < 0)
        ret += p;
    }
    cout << ret << endl;
  }
  
  return 0;
}