#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll MOD;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main()
{
    int n; cin>>MOD>>n;
    ll a[100010];
    for(int i=0; i<n; i++) cin>>a[i];
    string s; cin>>s;
    ll ans=a[0];
    for(int i=0; i<n-1; i++){
        if(s[i]=='+') (ans+=a[i+1])%=MOD;
        else if(s[i]=='-') (ans+=MOD-a[i+1])%=MOD;
        else if(s[i]=='*') (ans*=a[i+1])%=MOD;
        else (ans*=inv(a[i+1]))%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}