Task
Little Digit is, for whatever reason, interested in the sum of digits of numbers. For any non-negative integer x, let DigitSum(x) the sum of the digits of x. For example
DigitSum(123)DigitSum(998 877)DigitSum(0)=1+2+3=6,=9+9+8+8+7+7=48,=0.Her friend, Little Square, gave her an array A1,…,AN of N non-negative integers, as well as another array X1,…,XQ of Q non-negative integers. For every i=1,…,Q, help her find the sum
DigitSum(Xi+A1)+⋯+DigitSum(Xi+AN).
The first line contains N and Q. The next N+Q lines contain the numbers A1,…,AN,X1,…,XQ, in that order, each on one line.
Output data
Output Q lines. Line i of the output should contain the sum
DigitSum(Xi+A1)+⋯+DigitSum(Xi+AN).Constraints and clarifications
- 1≤N,Q≤5 000;
- 1≤Ai,Xi≤102 000.
| # |
Points |
Constraints |
| 1 |
19 |
Xi,Ai≤109 |
| 2 |
18 |
Xi,Ai consist only of digits 0,1,2,3,4 |
| 3 |
15 |
N,Q≤300 and Xi,Ai≤10300 |
| 4 |
24 |
N,Q≤1 000 |
| 5 |
24 |
No other restrictions |
Example
stdin
5 3
10
8
72
13
26
18
31
15
stdout
39
41
42
Explanation
The input is
A1A2A3A4A5=10,=8,=72,=13,=26and
X1X2X3=18,=31,=15.We must compute 3 sums.
The first sum is
DigitSum(X1+A1)+⋯+DigitSum(X1+A5)=DigitSum(18+10)+DigitSum(18+8)+DigitSum(18+72)+DigitSum(18+13)+DigitSum(18+26)=DigitSum(28)+DigitSum(26)+DigitSum(90)+DigitSum(31)+DigitSum(44)=2+8+2+6+9+0+3+1+4+4=39
The second sum is
DigitSum(X2+A1)+⋯+DigitSum(X2+A5)=DigitSum(31+10)+DigitSum(31+8)+DigitSum(31+72)+DigitSum(31+13)+DigitSum(31+26)=DigitSum(41)+DigitSum(39)+DigitSum(103)+DigitSum(44)+DigitSum(57)=4+1+3+9+1+0+3+4+4+5+7=41
The third sum is
DigitSum(X3+A1)+⋯+DigitSum(X3+A5)=DigitSum(15+10)+DigitSum(15+8)+DigitSum(15+72)+DigitSum(15+13)+DigitSum(15+26)=DigitSum(25)+DigitSum(23)+DigitSum(87)+DigitSum(28)+DigitSum(41)=2+5+2+3+8+7+2+8+4+1=42.