#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define OO 2'000'000'000
#define ull unsigned long long
#define nl '\n'
#define sz(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>


void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}




int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };

struct Off{
    ll cy,me,cost;
    Off(int _cy=0,int _me=0,int _cost=0){
        cy = _cy;
        me = _me;
        cost = _cost;
    }
};

ll n,a,b;
vector<Off>v;

bool check(ll cy,ll me,ll x,ll y){
    if(cy==0 && me==0) return false;
    return cy*y==me*x;
}

ll dp[41][11][11];

ll min_cost(ll idx,ll cy,ll me){
    if(idx == n){
        if(check(cy,me,a,b)){
            return 0;
        }
        return OO;
    }
    ll &ret = dp[idx][cy][me];
    if(ret != -1) return ret;
    ret = OO;
    ret = min(ret,min_cost(idx+1,cy+v[idx].cy,me+v[idx].me)+v[idx].cost);
    ret = min(ret,min_cost(idx+1,cy,me));
    return ret;
}


void solve(){
  cin>>n>>a>>b;
  v = vector<Off>(n);
    for(int i=0;i<n;i++){
        cin>>v[i].cy>>v[i].me>>v[i].cost;
    }
    memset(dp,-1,sizeof (dp));
    ll res = min_cost(0,0,0);
    if(res >= OO){
        cout<<-1<<nl;
    }else{
        cout<<res<<nl;
    }



}

int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){
solve();
}
return 0;
}