Problem: Zeyad wants to commit n crimes in Egypt and not be punished at the end. There are several types of crimes. For example, bribery is a crime but is not considered such when repeated twice. Therefore, bribery is not considered a crime when repeated an even number of times. Speeding is a crime, but is not considered such when repeated a number of times which is a multiple of five.

More specifically, c conditions on crime repetitions are known. Each condition describes the crime type ti and its multiplicity mi. If the number of times Zeyad committed the crime ti is a multiple of mi, Zeyad will not be punished for crime ti. Some crimes may be listed more than once. In this case fulfilling at least one condition for this crime is enough to not be punished for it. Of course, if for certain crime the number of times Zeyad committed it is zero, he is innocent with respect to this crime.

Now Zeyad is interested in a number of ways he can commit exactly n crimes without any punishment.

The order of commiting the crimes matters. More formally, two ways, sequences w1 and w2, of committing n crimes are equal if w1i = w2i, for all 1 ≤ i ≤ n.

Input

The first line contains two integers n and c (0 ≤ n ≤ 1018, 0 ≤ c ≤ 1000) — the number of crimes Zeyad would like to commit and the number of conditions he is aware of.

Then the definitions for c conditions follow. There are 26 types of crimes. Each crime definition consists of crime type — a capital Latin letter — and its multiplicity. 

The multiplicity of each crime is a positive integer number and the product of all multiplicities does not exceed 123. Some conditions may be repeated in the input more than once.

Crime of multiplicity 1 is not yielding any punishment regardless of the number of times it was committed. The strictness of the law is compensated by the fact that it's non-mandatory.

Obviously, if some crime is not listed in the set of conditions, then Zeyad will not consider it, as committing it would unavoidably lead to the punishment.

Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cin stream (you may also use the %I64d specificator).

Output

Output the number of different ways Zeyad can commit exactly n crimes with no punishment modulo 12345.

Examples

Input

5 2
A 1
B 2


Output

16


Input

6 3
A 1
B 2
C 3


Output

113


Input

8 3
A 2
A 3
B 2


Output

128

Note

In the first test case, the 16 ways are: AAAAA, AAABB, AABAB, AABBA, ABAAB, ABABA, ABBAA, BAAAB, BAABA, BABAA, BBAAA, ABBBB, BABBB, BBABB, BBBAB, BBBBA.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = 12345;
const int MAXN = 1100;
int maxv[30];
vector<int> G[30], ans;
long long m;
int n, cntv;
struct Matrix {
  long long map[125][125];
  Matrix operator*(const Matrix &b) const {
    Matrix c;
    memset(c.map, 0, sizeof(c.map));
    for (int i = 1; i <= cntv; ++i)
      for (int j = 1; j <= cntv; ++j)
        for (int k = 1; k <= cntv; ++k)
          c.map[i][j] = (c.map[i][j] + map[i][k] * b.map[k][j]) % MOD;
    return c;
  }
} M, rnt;
struct Node {
  int a[30];
  bool operator<(const Node &b) const {
    for (int i = 1; i <= 26; ++i)
      if (a[i] != b.a[i]) return a[i] < b.a[i];
    return 0;
  }
} t;
map<Node, int> hsh;
bool Check(Node t) {
  for (int i = 1; i <= 26; ++i) {
    if (maxv[i] == 0) continue;
    bool flag = false;
    for (int j = 0; j < G[i].size(); ++j)
      if (t.a[i] % G[i][j] == 0) {
        flag = true;
        break;
      }
    if (!flag) return false;
  }
  return true;
}
void DFS(int u) {
  if (u == 27) {
    hsh[t] = ++cntv;
    if (Check(t)) ans.push_back(cntv);
    return;
  }
  if (maxv[u] == 0)
    t.a[u] = 0, DFS(u + 1);
  else {
    for (int i = 0; i < maxv[u]; ++i) t.a[u] = i, DFS(u + 1);
  }
}
void Pow(long long k) {
  for (int i = 1; i <= cntv; ++i) rnt.map[i][i] = 1;
  while (k) {
    if (k & 1) rnt = rnt * M;
    M = M * M;
    k >>= 1;
  }
}
int main() {
  scanf("%lld%d", &m, &n);
  char c;
  int x;
  for (int i = 1; i <= n; ++i) {
    scanf(" %c%d", &c, &x);
    G[c - 'A' + 1].push_back(x);
    if (maxv[c - 'A' + 1])
      maxv[c - 'A' + 1] *= x;
    else
      maxv[c - 'A' + 1] = x;
  }
  if (m == 0) {
    printf("1");
    return 0;
  }
  if (n == 0) {
    printf("0");
    return 0;
  }
  Node cur, nxt;
  int v1, v2;
  DFS(1);
  for (map<Node, int>::iterator i = hsh.begin(); i != hsh.end(); ++i) {
    cur = i->first;
    v1 = i->second;
    for (int j = 1; j <= 26; ++j) {
      if (maxv[j] == 0) continue;
      nxt = cur;
      nxt.a[j] = (nxt.a[j] + 1) % maxv[j];
      v2 = hsh[nxt];
      M.map[v2][v1]++;
    }
  }
  Pow(m);
  int sumv = 0;
  for (int i = 0; i < ans.size(); ++i) sumv = (sumv + rnt.map[ans[i]][1]) % MOD;
  printf("%d\n", sumv);
  return 0;
}