PRATA  Roti Prata
IEEE is having its AGM next week and the president wants to serve cheese prata after the meeting. The subcommittee members are asked to go to food connection and get P(P<=1000) pratas packed for the function. The stall has L cooks(L<=50) and each cook has a rank R(1<=R<=8). A cook with a rank R can cook 1 prata in the first R minutes 1 more prata in the next 2R minutes, 1 more prata in 3R minutes and so on(he can only cook a complete prata) ( For example if a cook is ranked 2.. he will cook one prata in 2 minutes one more prata in the next 4 mins an one more in the next 6 minutes hence in total 12 minutes he cooks 3 pratas in 13 minutes also he can cook only 3 pratas as he does not have enough time for the 4th prata). The webmaster wants to know the minimum time to get the order done. Please write a program to help him out.
Input
The first line tells the number of test cases. Each test case consist of 2 lines. In the first line of the test case we have P the number of prata ordered. In the next line the first integer denotes the number of cooks L and L integers follow in the same line each denoting the rank of a cook.
Output
Print an integer which tells the number of minutes needed to get the order done.
Example
Input:
3
10
4 1 2 3 4
8
1 1
8
8 1 1 1 1 1 1 1 1
Output:
12
36
1
hide comments
beatrock:
20210911 17:39:00
why we need 12 min in 1st example?


sj_2330:
20210905 09:52:22
great question 

bappa_10:
20210814 13:23:18
what will be the max required time in worst case...???


luser24:
20210720 18:54:56
why we need 12 min in 1st example?


amanscisingh:
20210714 16:28:18
why tle in python? does this platform doesn't considers slow languages?


imran_2018:
20210630 08:04:47
Easy peasy lemon squeezzzy !!. Very good question on binary search. 

sagar_rohi:
20210619 07:22:16
accepted in second Go!!! 

koustubh38:
20210613 07:51:42
was it easy as i have solved two problems on same concept or i have learn to sole these problems 

coder_758:
20210609 10:13:55
Ac in one go confidence level aasman farte hue 

garvit_99:
20210522 09:35:42
good question mja aagya krke

Added by:  Saransh Bansal 
Date:  20110514 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem NTU IEEE codejam 2011 