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

ll modpow(ll a, ll e, ll m){
    ll r = 1;
    while (e){
        if (e&1) r = r*a%m;
        a = a*a%m;
        e >>= 1;
    }
    return r;
}

int main(){
    int P, N;
    cin >> P >> N;
    vector<int> A(N);
    string S;
    for (int& x : A) cin >> x;
    cin >> S;

    ll now = A[0];
    for (int i = 1; i < N; i++){
        if (S[i-1] == '+') now = (now+A[i])%P;
        else if (S[i-1] == '-') now = (now-A[i]+P)%P;
        else if (S[i-1] == '*') now = (now*A[i])%P;
        else now = (now*modpow(A[i], P-2, P))%P;
    }

    cout << now << endl;
}