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
HELLO:
20110110 06:34:34
given input in the form of string or not ??


Eddy R. Morales Perez:
20101130 05:33:02
Last edit: 20120129 22:54:59 

Eddy R. Morales Perez:
20101130 05:08:10
Last edit: 20120129 22:55:15 

`Pretty♥^` Cloud`:
20101011 09:06:42
Very similar to


BACK:
20100930 17:27:09
i m getting wa but my ans is correct for given test cases..any problem with newline 

rockdude:
20100925 06:28:42
@Triple S:


Triple S:
20100728 12:41:00
Would a greedy approach work here? 

vimal raj sharma old account:
20091123 14:41:26
@ Rohit B.V.


Rohith B.V.:
20090724 08:59:34
lol at the 3rd sample test case... 3.14159265 
Added by:  Daniel Gómez Didier 
Date:  20081117 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 
Resource:  2007  Circuito de Maratones ACIS / REDIS 