#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

ll mod;
ll modinv(ll a){
    if(a==0) abort();
    ll b = mod, u = 1, v = 0;
    while(b){
        ll t = a/b;
        a -= t * b; swap(a,b);
        u -= t * v; swap(u,v);
    }
    u %= mod;
    if(u<0) u += mod;
    return u;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    cin >> mod;
    int N; cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    string S; cin >> S;
    S = '?' + S;

    ll X = A[0];
    rep(i,N) if(i) {
        if(S[i] == '+') {
            X = (X + A[i]) % mod;
        } else if(S[i] == '-') {
            X = (X - A[i] + mod) % mod;
        } else if(S[i] == '*') {
            X = X * A[i] % mod;
        } else if(S[i] == '/') {
            X = X * modinv(A[i]) % mod;
        }
    }
    cout << X << endl;
}