#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Printv(v)                                                              \
    {                                                                          \
        REP(x, v.size()) { cout << v[x] << (x == v.size() - 1 ? "\n" : " "); } \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<double> VD;

const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define PI 3.141592653589793238

ll N, ma, mb, a[40], b[40], c[40];

map<PL, ll> memo1, memo2;

signed main() {
    cin >> N >> ma >> mb;
    REP(i, N) cin >> a[i] >> b[i] >> c[i];
    ll N2 = N / 2;
    REP(i, 1LL << N2) {
        ll sa = 0, sb = 0, sc = 0;
        REP(j, N) if(i >> j & 1) sa += a[j], sb += b[j], sc += c[j];
        if(memo1.count({sa, sb}))
            memo1[{sa, sb}] = min(memo1[{sa, sb}], sc);
        else
            memo1[{sa, sb}] = sc;
    }
    REP(i, 1LL << (N - N2)) {
        ll sa = 0, sb = 0, sc = 0;
        REP(j, N)
        if(i >> j & 1) sa += a[N2 + j], sb += b[N2 + j], sc += c[N2 + j];
        if(memo2.count({sa, sb}))
            memo2[{sa, sb}] = min(memo2[{sa, sb}], sc);
        else
            memo2[{sa, sb}] = sc;
    }
    ll ans = LINF;
    FOREACH(b, memo2) {
        ll ba = b.fi.fi;
        ll bb = b.fi.se;
        ll bc = b.se;
        FOR(i, 1, 400 / max(ma, mb) + 1) {
            if(memo1.count({i * ma - ba, i * mb - bb})) {
                ans = min(ans, memo1[{i * ma - ba, i * mb - bb}] + bc);
            }
        }
    }
    cout << (ans == LINF ? -1 : ans) << "\n";
}


Measured memory_bytes: 896