#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
    #include <filesystem>
    namespace fs = std::filesystem;
#else
    #define DBG(X)
    #define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

struct drug{
    int a,b,c;
    drug(int a=0,int b=0,int c=0):a(a),b(b),c(c){}
    drug &operator+=(const drug &x){a+=x.a;b+=x.b;c+=x.c; return *this;}
};

int N,Ma,Mb;
vector<int> A,B,C;
vector<drug> drugsA,drugsB;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path __p = __FILE__;
        fs::path __input, __output;
        __input = __output = __p.parent_path();
        __input += string("/input/") + string(__p.stem()) + string(".txt");
        __output += string("/output/") + string(__p.stem()) + string(".txt");
        freopen(__input.c_str(), "r", stdin);
        freopen(__output.c_str(), "w", stdout);
    #endif
    cin >> N >> Ma >> Mb;
    for (int i = 0; i < N; i++)
    {
        int a,b,c; cin >> a >> b >> c;
        if(i<N/2) drugsA.emplace_back(a,b,c);
        else drugsB.emplace_back(a,b,c);
    }
    
}

int solve(){
    int m=drugsA.size();
    vector<drug> dCA;
    int ans=INT_INF;
    for (int bit = 0; bit < (1<<m); bit++)
    {
        drug d;
        for (int j = 0; j < m; j++)
        {
            if((bit>>j)&1){
               d += drugsA[j];
            }
        }
        dCA.push_back(d);
    }

    
    m=drugsB.size();
    vector<drug> dCB;
    for (int bit = 0; bit < (1<<m); bit++)
    {
        drug d;
        for (int j = 0; j < m; j++)
        {
            if((bit>>j)&1){
               d += drugsB[j];
            }
        }
        dCB.push_back(d);
    }
    unordered_map<int, unordered_map<int,int> > memo;
    for(auto db:dCB){
        if(memo[db.a][db.b]==0) memo[db.a][db.b] = db.c;
        else memo[db.a][db.b] = min(memo[db.a][db.b],db.c);
    }

    for(auto d:dCA) {
        if(d.c==0) continue;
        if(Ma*d.b==Mb*d.a) ans = min(ans,d.c);
        else{
            for (int k = 1; k <= 10; k++)
            {           
                int x=k*Ma-d.a;
                int y=k*Mb-d.b;
                if(x<0 || y<0) continue;
                if(memo[x][y]==0) continue;
                else ans = min(ans,d.c+memo[x][y]);
            }
        }
    }
 
    for(auto d:dCB) {
        if(d.c==0) continue;
        if(Ma*d.b==Mb*d.a) ans = min(ans,d.c);
    }

    if(ans==INT_INF) ans=-1;
    cout << ans << endl;
    return 0;
}   

int main()
{
    input();
    solve();
    return 0;
}


Measured memory_bytes: 33000