#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

const ll INF = 1e18;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

template <typename T>
T modpower(T a, T n, T mod) {
    T res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

template <typename T>
T modinv(T a, T mod) {
    return modpower(a, mod - 2, mod);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    ll p;
    int n;
    cin >> p >> n;
    vector<ll> a(n);
    rep (i, n) cin >> a[i];
    string s;
    cin >> s;
    ll res = a[0];
    rep (i, n - 1) {
        char ope = s[i];
        ll next = a[i + 1];
        if (ope == '+') {
            res += next;
        } else if (ope == '-') {
            res -= next;
        } else if (ope == '*') {
            res *= next;
        } else {
            res *= modinv(next, p);
        }
        if (res < 0) res += p;
        res %= p;
    }
    cout << res << endl;
    
    return 0;
}