STAMPS  Stamps
Everybody hates Raymond. He’s the largest stamp collector on planet earth and because of that he always makes fun of all the others at the stamp collector parties. Fortunately everybody loves Lucy, and she has a plan. She secretly asks her friends whether they could lend her some stamps, so that she can embarrass Raymond by showing an even larger collection than his. Raymond is so sure about his superiority that he always tells how many stamps he’ll show.And since Lucy knows how many she owns, she knows how many more she needs. She also knows how many friends would lend her some stamps and how many each would lend. But she’s like to borrow from as few friends as possible and if she needs too many then she’d rather not do it at all. Can you tell her the minimum number of friends she needs to borrow from?
Input
The first line contains the number of scenarios. Each scenario describes one collectors party and its first line tells you how many stamps (from 1 to 1000000) Lucy needs to borrow and how many friends (from 1 to 1000) offer her some stamps. In a second line you’ll get the number of stamps (from 1 to 10000) each of her friends id offering.
Output
The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print a single line with the minimum number of friends Lucy needs to borrow stamps from. If it’s impossible even if she borrows everything from everybody, write impossible. Terminate the output for the scenario with a blank line.
Example
Input: 3 100 6 13 17 42 9 23 57 99 6 13 17 42 9 23 57 1000 3 314 159 265 Output: Scenario #1: 3 Scenario #2: 2 Scenario #3: impossible
hide comments
m_sundriyal:
20180323 19:41:56
Before submitting take care of the following points:


kkislay20:
20180309 10:35:44
Super easy, AC in one go, sort() and you are done, nothing is there 

ayusofayush:
20180216 06:28:52
AC in one go ;) just take care of the output format.... 

nsh__:
20180209 09:59:46
Why cant they give basic Output format


maansari525:
20180119 18:49:16
AC in one go! 

prasad_235:
20180113 19:41:28
Thank you very much venkat016 

aravind1485:
20180108 07:36:09
printing imposible instead of impossible


akhand_mishra:
20180102 13:52:40
":" costed me 2 WA 

sayasaiteja:
20171211 08:09:50
ac in one go


amankumarjha:
20171113 11:56:04
It teaches me how to sort in descending order just using sort function and inbuilt greater<>() function 
Added by:  Daniel Gómez Didier 
Date:  20081117 
Time limit:  0.635s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 
Resource:  2007  Circuito de Maratones ACIS / REDIS 