1578: Math, math everywhere
Time Limit: 2 Sec Memory Limit: 256 MBSubmit: 0 Solved: 0
[Submit] [Status] [Web Board] [Creator:]
Description
time limit per test
5 secondsmemory limit per test
512 megabytesinput
standard inputoutput
standard outputIf you have gone that far, you'll probably skip unnecessary legends anyway...
You are given a binary string 
and an integer 
. Find the number of integers k, 0≤k<N, such that for all i=0, 1, ..., m-1
Input
In the first line of input there is a string s consisting of 0's and 1's (1≤|s|≤40).
In the next line of input there is an integer n (1≤n≤5·105).
Each of the next n lines contains two space-separated integers pi, αi (1≤pi,αi≤109, pi is prime). All pi are distinct.
Output
A single integer− the answer to the problem.
Examples
Input
1
2
2 1
3 1
Output
2
Input
01
2
3 2
5 1
Output
15
Input
1011
1
3 1000000000
Output
411979884