SP180 CONTPACK - How to pack containers

Products of a factory are packed into cylindrical boxes. All boxes have the same bases. A height of a box is a non-negative integer being a power of 2, i.e. it is equal to 2 _$ ^{i} $_ for some _i_ = 0, 1, 2, ... . The number _i_ (exponent) is called a size of a box. All boxes contain the same goods but their value may be different. Goods produced earlier are cheaper. The management decided, that the oldest (cheapest) goods should be sold out first. From the warehouse goods are transported in containers. Containers are also cylindrical. A diameter of each container is a little bigger than a diameter of a box, so that boxes can be easily put into containers. A height of a container is a non-negative power of 2. This number is called a size of a container. For safe transport containers should be tightly packed with boxes, i.e. the sum of heights of boxes placed in a container have to be equal to the height of this container. A set of containers was delivered to the warehouse. Check if it is possible to pack all the containers tight with boxes that are currently stored in the warehouse. If so, find the minimal value of goods that can be tightly packed into these containers. Consider a warehouse with 5 boxes. Their sizes and values of their contents are given below: ``` 1 3 1 2 3 5 2 1 1 4 ``` Two containers of size 1 and 2 can be tightly packed with two boxes of total value 3, 4 or 5, or three boxes with total value 9. The container of size 5 cannot be tightly packed with boxes from the warehouse. ### Task Write a program that for each test case: - reads descriptions of boxes (size, value) from a warehouse and descriptions of containers (how many containers of a given size we have); - checks if all containers can be tightly packed with boxes from the warehouse and if so, computes the minimal value of goods that can be tightly packed into these containers; - writes the result.

The number of test cases _t_ is in the first line of input, then _t_ test cases follow separated by an empty line. In the first line of a test case there is an integer _n_, 1

For each test case your program should output exactly one line containing: - a single word "No" if it is not possible to pack the containers from the given set tight with the boxes from the warehouse, or - a single integer equal to the minimal value of goods in boxes with which all the containers from the given set can be packed tight.