A frogman uses a special equipment for diving. He has a cylinder with two containers: one with oxygen and the other with nitrogen. Depending on the time he wants to stay under water and the depth of diving the frogman needs various amount of oxygen and nitrogen. The frogman has at his disposal a certain number of cylinders. Each cylinder can be described by its weight and the volume of gas it contains. In order to complete his task the frogman needs specific amount of oxygen and nitrogen. What is the minimal total weight of cylinders he has to take to complete the task?

Example

The frogman has at his disposal 5 cylinders described below. Each description consists of: volume of oxygen, volume of nitrogen (both values are given in litres) and weight of the cylinder (given in decagrams):

3 36 120
10 25 129
5 50 250
1 45 130
4 20 119

Task

Write a program that:

• reads frogman's demand for oxygen and nitrogen, the number of accessible cylinders and their descriptions from the text file PLE.IN;
• computes the minimal total weight of cylinders the frogman needs to complete his task;
• writes the result to the text file PLE.OUT.

Input

In the first line of the input file PLE.IN there are two integers t, a separated by a single space, 1<=t<=21 and 1<=a<=79. They denote volumes of oxygen and nitrogen respectively, needed to complete the task. The second line contains one integer n, 1<=n<=1000, which is the number of accessible cylinders. The following n lines contain descriptions of cylinders; (i+2)-nd line of the file PLE.IN contains three integers ti, ai, wi separated by single spaces, (1<=ti<=21, 1<=ai<=79, 1<=wi<=800). These are respectively: volume of oxygen and nitrogen in the i-th cylinder and the weight of this cylinder.

Output

Your program should write one integer to the first and only line of the output file PLE.OUT. This number should be the minimal total weight of cylinders the frogman should take to complete the task.

Example

For the input file PLE.IN:

5 60
5
3 36 120
10 25 129
5 50 250
1 45 130
4 20 119

249