Naman owns a very famous Ice Cream parlour in Pune. He has a wide range of flavours with different pricing. 

Every flavour costs ₹ X per gram and quantity of each flavour in the parlour is indefinite. Now, Naman has 

received an order for a party wherein he is asked to prepare each Ice Cream with N number of flavours. 

He needs to prepare each Ice Cream of W grams and at the same time has to keep the cost minimum. 

Can you help him out?

Note: If it is not possible to prepare such an Ice Cream, print “Not Possible”.

-----Input:-----

First line contains an integer T denoting the number of test cases.

First line of every test case contains an integer N denoting the number of flavours.

The second line of every test case by N space separated integers denoting the cost per gram of each flavour. 

Second line of every test case contains two space separated integers W and Y denoting the weight 

of Ice Cream in grams and the number of flavours to be used respectively. 

-----Output:-----

For each test case, print the total cost of the Ice Cream in a single line.

-----Constraints:-----
1 ≤ T ≤ 100
1 ≤ N,W,Y ≤ 40000

-----Example:-----Input:
2
5 
4 6 8 1 10
10 3
2
1 2
1 2Output:

18

Not Possible

-----Explanation:-----

In the first test case to achieve the minimum cost, the Ice Cream will consist of 8 grams 

of flavour costing ₹1, 1 gram of flavour costing ₹4 and 1 gram of flavour costing ₹6.

In the second test case it is not possible to make an ice-cream weighing 1 gram using 2 flavours.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import sys\nimport math\n\ndef solution():\n T = int(input().strip())\n for _ in range(T):\n  n = int(input().strip())\n  cost_of_flavour = list(map(int, input().strip().split(\' \')))\n  cost_of_flavour = sorted(cost_of_flavour)\n  w, y = list(map(int, input().strip().split(\' \')))\n\n  if y > w or y > n:\n   print("Not Possible")\n   continue\n  else:\n   min_sum = 0\n   for i in range(y):\n    min_sum += cost_of_flavour[i]\n   min_sum += cost_of_flavour[0]*(w - y)\n   print("%d"%(min_sum))\nsolution()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13941