#include int ri() { int n; scanf("%d", &n); return n; } int mpow(int a, int b, int mod) { int res = 1; for (; b; b >>= 1) { if (b & 1) res = (int64_t) res * a % mod; a = (int64_t) a * a % mod; } return res; } int main() { int p = ri(); int n = ri(); int a[n]; for (auto &i : a) i = ri(); std::string s; std::cin >> s; int cur = a[0]; for (int i = 0; i + 1 < n; i++) { if (s[i] == '+') { cur += a[i + 1]; if (cur >= p) cur -= p; } else if (s[i] == '-') { cur -= a[i + 1]; if (cur < 0) cur += p; } else if (s[i] == '*') { cur = (int64_t) cur * a[i + 1] % p; } else { cur = (int64_t) cur * mpow(a[i + 1], p - 2, p) % p; } } printf("%d\n", cur); return 0; }