Fibonotci sequence is an integer recursive sequence defined by the recurrence relation

Sequence s is an infinite and almost cyclic sequence with a cycle of length N. A sequence s is called almost cyclic with a cycle of length N if , for i ≥ N, except for a finite number of values s_i, for which (i ≥ N).

Following is an example of an almost cyclic sequence with a cycle of length 4:

Notice that the only value of s for which the equality does not hold is s₆ (s₆ = 7 and s₂ = 8). You are given s₀, s₁, ...s_N - 1 and all the values of sequence s for which (i ≥ N).

Find .

The first line contains two numbers K and P. The second line contains a single number N. The third line contains N numbers separated by spaces, that represent the first N numbers of the sequence s. The fourth line contains a single number M, the number of values of sequence s for which . Each of the following M lines contains two numbers j and v, indicating that and s_j = v. All j-s are distinct.

• 1 ≤ N, M ≤ 50000
• 0 ≤ K ≤ 10¹⁸
• 1 ≤ P ≤ 10⁹
• 1 ≤ s_i ≤ 10⁹, for all i = 0, 1, ...N - 1
• N ≤ j ≤ 10¹⁸
• 1 ≤ v ≤ 10⁹
• All values are integers

Output should contain a single integer equal to .