//  ____            _                  _                       _       _
// |  _ \ _   _ ___| |_    ___ _ __   | |_ ___ _ __ ___  _ __ | | __ _| |_ ___
// | |_) | | | / __| __|  / __| '_ \  | __/ _ \ '_ ` _ \| '_ \| |/ _` | __/ _ \
// |  _ <| |_| \__ \ |_  | (__| |_) | | ||  __/ | | | | | |_) | | (_| | ||  __/
// |_| \_\\__,_|___/\__|  \___| .__/___\__\___|_| |_| |_| .__/|_|\__,_|\__\___|
//                            |_| |_____|               |_|

//                                                     _        _ _ _____  ___
//                               _ __ ___   __ _ _ __ | |_ __ _/ / |___ / / _ \
//                              | '_ ` _ \ / _` | '_ \| __/ _` | | | |_ \| | | |
//                              | | | | | | (_| | | | | || (_| | | |___) | |_| |
//                              |_| |_| |_|\__,_|_| |_|\__\__,_|_|_|____/ \___/

//https://github.com/manta1130/Competitive_Programming_Template_Rust

#[macro_use]
mod input {

    use std;
    use std::io;

    const SPLIT_DELIMITER: char = ' ';

    #[macro_export]
    #[allow(unused_macros)]
    macro_rules! input {
    ( $($x:expr ),*) => {
        {
            let temp_str = input_line_str();
            let mut split_result_iter = temp_str.split_whitespace();
                $(
                let buf_split_result = split_result_iter.next();
                let buf_split_result = buf_split_result.unwrap();
                    ($x) = buf_split_result.parse().unwrap();
                )*
        }
    };
}

    #[allow(dead_code)]
    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn p<T>(t: T)
    where
        T: std::fmt::Display,
    {
        println!("{}", t);
    }

    #[allow(dead_code)]
    pub fn input_vector2d<T>(line: usize) -> Vec<Vec<T>>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<Vec<T>> = Vec::new();

        for _ in 0..line {
            let vec_line = input_vector();
            v.push(vec_line);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}

mod vectools {

///C++のupper_boundと同等の実装
pub fn upper_bound<T>(v: &Vec<T>, k: T) -> usize
where
    T: PartialOrd,
{
    let mut from = 0;
    let mut to = v.len();

    while to - from > 1 {
        let mid = (from + to) / 2;
        if v[mid] <= k {
            from = mid;
        } else {
            to = mid;
        }
    }
    if v[from] > k {
        from
    } else {
        to
    }
}

///C++のlower_boundと同等の実装
pub fn lower_bound<T>(v: &Vec<T>, k: T) -> usize
where
    T: PartialOrd,
{
    let mut from = 0;
    let mut to = v.len();

    while to - from > 1 {
        let mid = (from + to) / 2;
        if v[mid] < k {
            from = mid;
        } else {
            to = mid;
        }
    }

    if v[from] < k {
        to
    } else {
        from
    }
}

///次の順列を求める。
pub fn next_permutation<T>(v: &mut Vec<T>) -> bool
where
    T: PartialOrd,
{
    let mut pivot = v.len() - 1;
    loop {
        if pivot == 0 {
            return false;
        }
        if v[pivot] > v[pivot - 1] {
            pivot -= 1;
            break;
        }
        pivot -= 1;
    }
    let mut pivot_swap = v.len() - 1;
    while v[pivot] >= v[pivot_swap] {
        pivot_swap -= 1;
    }
    v.swap(pivot, pivot_swap);
    v[pivot + 1..].reverse();
    true
}

}

use input::*;
use vectools::*;

fn dfs(
    l: &Vec<(usize, usize, usize)>,
    i: usize,
    res: &mut Vec<(usize, usize, usize, isize)>,
    a: usize,
    b: usize,
    c: usize,
    ma: usize,
    mb: usize,
) {
    if i >= l.len() {
        res.push((a, b, c, (ma * b) as isize - (mb * a) as isize));
        return;
    }
    res.push((a, b, c, (ma * b) as isize - (mb * a) as isize));

    dfs(l, i + 1, res, a, b, c, ma, mb);
    dfs(l, i + 1, res, a + l[i].0, b + l[i].1, c + l[i].2, ma, mb);
}

fn main() {
    let (n, ma, mb): (usize, usize, usize);
    input!(n, ma, mb);
    let mut l1 = vec![];
    let mut l2 = vec![];
    let mut flag = true;
    for _ in 0..n {
        let (a, b, c);
        input!(a, b, c);
        if flag {
            l1.push((a, b, c));
        } else {
            l2.push((a, b, c));
        }
        flag = !flag;
    }

    let mut res1 = vec![];
    let mut res2 = vec![];

    dfs(&l1, 0, &mut res1, 0, 0, 0, ma, mb);
    dfs(&l2, 0, &mut res2, 0, 0, 0, ma, mb);

    let mut ans = usize::max_value();

    res2.sort_by(|a, b| a.2.cmp(&b.2));
    res2.sort_by(|a, b| a.3.cmp(&b.3));

    let mut cpvec = vec![];
    for i in &res2 {
        cpvec.push(i.3);
    }

    for i in 0..res1.len() {
        //println!("{}{:?} {}{:?}", i, &res1[i], j, &res2[j]);
        let f = lower_bound(
            &cpvec,
            (mb * res1[i].0) as isize - (ma * res1[i].1) as isize,
        );
        let t = upper_bound(
            &cpvec,
            (mb * res1[i].0) as isize - (ma * res1[i].1) as isize,
        );
        for j in f..t {
            if j < res2.len() && res2[j].3 == (mb * res1[i].0) as isize - (ma * res1[i].1) as isize
            {
                if res1[i].2 + res2[j].2 == 0 {
                    continue;
                }
                if (res1[i].1 + res2[j].1) * ma != (res2[j].0 + res1[i].0) * mb {
                    panic!("");
                }
                ans = std::cmp::min(ans, res1[i].2 + res2[j].2);
                break;
            }
        }
    }

    if ans == usize::max_value() {
        p(-1);
    } else {
        p(ans);
    }
}



Measured memory_bytes: 167156