Help John..!!
Tag(s):

## Easy

Problem
Editorial
Analytics

John Snow is travelling from Winterfell to Dragonstone to meet Daeneryys Targaryen. In between, Winterfell and Dragonstone there are ‘N’ number of towns numbered 1,2,3… N (excluding Winterfell). John will start travelling from Winterfell to town 1 and then to town 2 and so on upto town N (Dragonstone). Winterfell is numbered as Town 0. John Snow loves to drink Blackberry wine while travelling.

Each town has got some value ‘C’ associated with it i.e number of bottles of Blackberry at each that town. The value of ‘C’ for Winterfell is 0.

When moving from town ‘i’ to town ‘i+1’, John Snow will either get or lose some bottles of Blackberry Wine. While moving from town i to town i+1, John snow will get Ci – Ci+1 ,0<=i< N ,bottles if this number is non-negative else he will lose that number of bottles.

John snow cannot move from town i to town i+1 if he has negative number of bottles with him at any point of time. So, he might need to buy some bottles of wine to continue his journey to Dragonstone. Price of each bottle of Blackberry wine is ‘X’ .

Initially, John has ‘P’ amount of money with him, so he asks you whether it is possible for him to travel to Dragonstone or not. If it is possible to reach, what amount of money he can save while spending minimum amount of money. If it is not possible, how much more minimum amount of money he will require to reach Dragonstone.

Input :

• First line of the input will contain T (No. of test cases).
• For each test case, first line will contain three space separated integers N, X and P (i.e. number of towns, price of each Blackberry wine bottle and amount of money John is having respectively.) Next line will contain N space separated integers denoting Ci, the number of Blackberry wine bottles at ith town.

Output :

For every test case, if it is possible to reach Dragonstone print “Possible” without quotes and next line print amount of money John will be able to save. If it is not possible to reach Dragonstone with ‘P’ amount of money print “Impossible” without quotes and also print minimum amount of money needed more in next line.

Constraints :

• 1<=T<=10
• 1<=N<=100000 (10^5)
• 1<=Ci<=10^9
• 1<=X<=1000
• 1<=P<=10^9
SAMPLE INPUT
2
2 10 40
1 3
3 5 10
1 4 1
SAMPLE OUTPUT
Possible
10
Impossible
10
Explanation

For the first test case:

Cost of each bottle is 10. John is having 40 amount of money with him . John will buy 1 bottle (0-1=-1) at town 1 and 2 bottles (1-3=-2) at town 2 . So John can easily reach to Dragonstone and will be able to save 10 amount of money.

For the second test case:

Cost of each bottle is 5. John has 10 amount of money with him. John will have to buy 1 bottle at town 1 (0-1=-1) and 3 bottles of wine at town 2 (1-4=-3). John will get 3 bottles of wine while moving from town 2 to town 3 ( 4-1=3) which he can use in future. So total cost incurred will be 4*5=20 but John has only 10 amount of money. So,it is Impossible for him to reach is destination and he need 10 more amount of money to reach Dragonstone.

Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Swift-4.1, TypeScript, Visual Basic

## CODE EDITOR

Initializing Code Editor...

## This Problem was Asked in

Challenge Name

CodeMaze v3.0

OTHER PROBLEMS OF THIS CHALLENGE
• Algorithms > Greedy Algorithms
• Math > Number Theory
• Algorithms > Searching
• Algorithms > Graphs
• Algorithms > Dynamic Programming
• Data Structures > Advanced Data Structures