/* -*- coding: utf-8 -*-
 *
 * 1092.cc:  No.1092 modular arithmetic - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];
char s[MAX_N + 4];

/* subroutines */

int powmod(int a, int n, int p) {  // a^n % p
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % p;
    a = (ll)a * a % p;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int p, n;
  scanf("%d%d", &p, &n);

  for (int i = 0; i < n; i++) scanf("%d", as + i);
  scanf("%s", s);

  int x = as[0];
  for (int i = 1; i < n; i++)
    switch (s[i - 1]) {
    case '+': x = (x + as[i]) % p; break;
    case '-': x = (x + p - as[i]) % p; break;
    case '*': x = (ll)x * as[i] % p; break;
    case '/': x = (ll)x * powmod(as[i], p - 2, p) % p; break;
    }

  printf("%d\n", x);
  return 0;
}