#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

long long extGCD(long long a, long long b, long long &x, long long &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    long long d = extGCD(b, a%b, y, x);
    y -= a / b * x;
    return d;
}

inline long long mod(long long a, long long m) {
    return (a % m + m) % m;
}

long long modinv(long long a, long long m) {
    long long x, y;
    extGCD(a, m, x, y);
    return mod(x, m);
}

int main() {
    ll p, n;
    cin >> p >> n;
    ll a[n];
    rep(i,n)cin >> a[i];
    ll ans = a[0];
    string s;
    cin >> s;
    rep(i,n-1){
        if(s[i] == '+'){
            ans = (ans + a[i+1]) % p;
        }
        if(s[i] == '-'){
            ans = (ans + p - a[i+1]) % p;
        }
        if(s[i] == '*'){
            ans = ans * a[i+1] % p;
        }
        if(s[i] == '/'){
            ans = ans * modinv(a[i+1],p) % p;
        }
    }
    cout << ans << endl;
    return 0;
}