Problem:
Score : 400 points

Problem Statement

Dolphin is planning to generate a small amount of a certain chemical substance C.

In order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.

He does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.

The pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.

The package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).

Dolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.

Find the minimum amount of money required to generate the substance C.

If it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.

Constraints

1≦N≦40

1≦a_i,b_i≦10

1≦c_i≦100

1≦M_a,M_b≦10

gcd(M_a,M_b)=1

a_i, b_i, c_i, M_a and M_b are integers.

Input

The input is given from Standard Input in the following format:

N M_a M_b
a_1 b_1 c_1
a_2 b_2 c_2
:
a_N b_N c_N

Output

Print the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.

Sample Input 1

3 1 1
1 2 1
2 1 2
3 3 10

Sample Output 1

3

The amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.

In this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.

The total price of these packages is 3 yen.

Sample Input 2

1 1 10
10 10 10

Sample Output 2

-1

The ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.

Solution in Rust (1.15.1) (judge verdict: Accepted)

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

const ITEM_MAX: usize = 401;
const INF: usize = 10_000_000;
use std::cmp::min;

fn main() {
    input! {
        n: usize,
        m: (usize, usize),
        items: [((usize, usize), usize); n],
    }

    let mut dp = vec![vec![vec![INF; ITEM_MAX]; ITEM_MAX]; n + 1];

    dp[0][0][0] = 0;

    for i in 0..n {
        for j in 0..ITEM_MAX {
            for k in 0..ITEM_MAX {
                if dp[i][j][k] == INF {
                    continue;
                }
                // 加えない場合
                // なにも変わらないので、次の値と比較して小さい方で更新
                dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k]);

                // 加える場合
                let ((a, b), c) = items[i];
                let next_a = j + a;
                let next_b = k + b;
                // 他のパターンですでに更新されている場合もありうるので、今の値にCを足したものと、次のテーブルの対象の値とを比較して小さい方で更新
                dp[i + 1][next_a][next_b] = min(dp[i + 1][next_a][next_b], dp[i][j][k] + c);
            }
        }
    }

    let mut min_c = None;

    // 一番小さいCの合計を探す
    for j in 1..ITEM_MAX {
        for k in 1..ITEM_MAX {
            // 比率が同じ場合のみ
            // a:b = Ma:Mb => a*Mn == b*Ma
            let c = dp[n][j][k];
            if j * m.1 == k * m.0  && c != INF {
                min_c = min_c.map(|x| min(x, c)).or(Some(c));
            }
        }
    }
    match min_c {
        Some(x) => println!("{:?}", x),
        _ => println!("-1"),
    }
}