Problem C
---------

You are working in Advanced Computer Monitors (ACM), Inc. The company
is building and selling giant computer screens that are composed from
multiple smaller screens, arranged in a grid.  You are responsible for
design of the screens for your customers.

Customers order screens of the specified horizontal and vertical
resolution in pixels and a specified horizontal and vertical size in
millimeters.  Your task is to design a screen that has a required
resolution in each dimension or more, and has required size in each
dimension or more, with a minimal possible price. The giant screen is
always built as a grid of monitors of the same type. The total
resolution, size, and price of the resulting screen is simply the sum
of resolutions, sizes, and prices of the screens it is built from. 

You have a choice of regular monitor types that you can order and you
know their resolutions, sizes, and prices.  The screens of each type
can be mounted both vertically and horizontally, but the whole giant
screen must be composed of the screens of the same type in the same
orientation. You can use as many screens of the chosen type as you
need.

Input
-----

The first line will contain a single integer m.  The input will
contain m problem instances.  Each input instance will have the
following form.

The first line of the input for an instance contains four integer
numbers rh, rv, sh, and sv (all from 100 to 10,000 inclusive) --
horizontal and vertical resolution and horizontal and vertical size of
the screen you have to build, respectively.  The next line contains a
single integer number n  (1 <= n <= 100) -- the number of different
screen types available to you.  The next n lines contain descriptions
of the available screen types.  Each description occupies one line and
consists of five integer numbers -- rh(i), rv(i), sh(i), sv(i), p(i)
(all from 100 to 10,000 inclusive), where the first four numbers are
horizontal and vertical resolution and horizontal and vertical size of
i-th screen type, and p(i) is the price.

Output
------

For each input instance, write a single integer on a line by itself.
This integer should be the minimal price of the specified giant
screen.

Sample Input
------------
2
1024 1024 300 300
3
1024 768 295 270 200
1280 1024 365 301 250
1280 800 350 270 210
2400 2000 800 700
3
1024 768 295 270 200
1280 1024 365 301 250
1280 800 350 270 210

Sample Output
-------------
250
1260