#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

auto min_cost(const vec<lint>& a_list, const vec<lint>& b_list, const vec<lint>& c_list,
                lint Ma, lint Mb) {
    lint num_items = a_list.size();
    unordered_map<lint, lint> res;
    range(i, 1LL, (1LL << num_items)) {
        lint key = 0, cost = 0;
        range(s, 0, num_items) {
            if ((i >> s) & 1) {
                key += Ma * b_list[s] - Mb * a_list[s];
                cost += c_list[s];
            }
        }
        if (res.find(key) == res.end()) {
            res.emplace(key, cost);
        } else {
            res.at(key) = min(res.at(key), cost);
        }
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N, Ma, Mb;
    cin >> N >> Ma >> Mb;
    lint n_fh = N / 2, n_sh = N - n_fh;
    vec<lint> a_fh(n_fh), b_fh(n_fh), c_fh(n_fh);
    vec<lint> a_sh(n_sh), b_sh(n_sh), c_sh(n_sh);
    range(i, 0, n_fh) {
        lint a, b, c;
        cin >> a >> b >> c;
        a_fh.at(i) = a; b_fh.at(i) = b; c_fh.at(i) = c;
    }
    range(i, 0, n_sh) {
        lint a, b, c;
        cin >> a >> b >> c;
        a_sh.at(i) = a; b_sh.at(i) = b; c_sh.at(i) = c;
    }
    auto min_cost_first_half = min_cost(a_fh, b_fh, c_fh, Ma, Mb);
    auto min_cost_second_half = min_cost(a_sh, b_sh, c_sh, Ma, Mb);
    lint res = (1LL << 61);
    if (min_cost_first_half.find(0) != min_cost_first_half.end())
        res = min(res, min_cost_first_half.at(0));
    if (min_cost_second_half.find(0) != min_cost_second_half.end())
        res = min(res, min_cost_second_half.at(0));
    for (const auto pair : min_cost_first_half) {
        lint key = pair.first, cost = pair.second;
        lint complement = -key;
        if (min_cost_second_half.find(complement) != min_cost_second_half.end()) {
            lint total_cost = cost + min_cost_second_half[complement];
            res = min(res, total_cost);
        }
    }
    cout << (res == (1LL << 61) ? -1 : res) << "\n";
}


Measured memory_bytes: 384