DONOTHIN  Doing Nothing
Original statement in spanish at http://www.dc.uba.ar/events/icpc/download/problems/taip2011problems.pdf
A young couple uses to make their time as productive as possible. This activity is quite stressful, so they decided to "waste" some time watching their favorite TV series.
The series has N seasons, and each season has a possibly different number of chapters according to its success, actors availability, production time and other external factors. Each chapter has a duration of exactly M minutes.
To keep up with the plot, before watching each new season, they watch, without any rest, all the chapters of all the previous seasons. This has just made them concern about how much time they will be spending with this hobby, which should keep them calm. They need your help so they don't get back to the stressful situation they had.
Input
The input contains several test cases. Each test case is described in two lines. The first line has two integers N and M representing respectively how many seasons the series has and the duration in minutes of each chapter (1 <= N <= 10^{5}, 1 <= M <= 10^{6}). The next line has N integers C_i representing how many chapters each season has sorted chronologically. (1 <= C_i <= 100 for 1 <= i <= N). The last line of the input contains the number 1 twice and should not be processed as a test case.
Output
For each test case output a single line with an integer representing the number of minutes the couple spends in watching the whole series.
Example
Input:
6 20 24 23 15 22 24 17 1 100 100 10 1000000 99 99 99 99 99 99 99 99 99 99 1 1
Output:
9000 10000 5445000000
hide comments
karthik1997:
20150714 15:14:14
silly qn but listen


[deleted]:
20120608 07:34:00
Should be moved to Tutorial 

B.R.ARVIND:
20120605 14:19:45
first of all move this to tutorial , i wasted my 15 min :( 

gabber:
20120209 21:02:24
just a useless ques 

Sandeep Singh Jakhar:
20120204 22:12:22
Tutorial 

K@r+h!k :
20120107 10:59:13
This problem does not belong here. Should be moved to tutorial. 

Aditya Muttur:
20111226 07:14:22
what do they mean by without any rest? what is this time they take for rest. by my understanding they watch a season, then they watch all the seasons before it and then they start the next.


Vinay Saini:
20111121 10:55:16
should be moved to tutorial. 

Supan Shah:
20111110 19:07:06
are the outputs correct ?? i am getting 2500 for the first case ?? 

Nitin Sharma:
20111024 15:46:10
should be moved to tutorial. 
Added by:  Pablo Ariel Heiber 
Date:  20111004 
Time limit:  1.117s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Argentinian Programming Tournament 2011 