Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Crime Management

time limit per test

5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputZeyad 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 *t*_{i} and its multiplicity *m*_{i}. If the number of times Zeyad committed the crime *t*_{i} is a multiple of *m*_{i}, Zeyad will not be punished for crime *t*_{i}. 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 *w*1 and *w*2, of committing *n* crimes are equal if *w*1_{i} = *w*2_{i}, for all 1 ≤ *i* ≤ *n*.

Input

The first line contains two integers *n* and *c* (0 ≤ *n* ≤ 10^{18}, 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.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/27/2018 00:21:10 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|