#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

#define rep(i, n) for(int i = 0; i < n; ++i)

using ll = long long;

ll pow2(ll a, ll x, ll p){
    ll ret = 1;
    while(x){
        if(x & 1)ret = (ret * a) % p;
        a = (a * a) % p;
        x >>= 1;
    }
    return ret;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    int n, p;
    cin >> p >> n;
    vector<int> a(n);
    rep(i, n)cin >> a[i];
    string s;
    cin >> s;
    ll ans = a[0];
    rep(i, n - 1) {
        if (s[i] == '+') {
            ans += a[i + 1];
            ans %= p;
        }
        else if (s[i] == '-') {
            ans += p - a[i + 1];
            ans %= p;
        }
        else if (s[i] == '*') {
            ans *= (a[i + 1] % p);
            ans %= p;
        }
        else {
            ans *= pow2(a[i + 1], p - 2, p);
            ans %= p;
        }
    }
    cout << ans << '\n';
    
    return 0;
}