#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[10004],b[10004],c[10004];
int n;
int aa,bb;
int ans=-1;
void dfs(int now,int yi,int er,int jia){
    if(now>n){
        if(yi==aa && er==bb){
            if(ans!=-1)ans=min(ans,jia);
            else ans=jia;
            //cout<<ans<<endl;
        }
        return;
    }
    for(int i = 0;i<=min((bb-er)/b[now]+1,(aa-yi)/a[now]+1);i++){
        dfs(now+1,yi+i*a[now],er+i*b[now],jia+i*c[now]);
    }
    
}
signed main(){
    freopen("tioj_constructive.in","r",stdin);
    freopen("tioj_constructive.out","w",stdout);
    cin>>n>>aa>>bb;
    for(int i = 1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i];
    }
    if(n==2 && ((a[1]==0 && a[2]==1 && b[1]==1 && b[2]==0) || (a[1]==1 && a[2]==0 && b[1]==0 && b[2]==1))){
        if(a[1]==1){
            cout<<c[1]*aa+c[2]*bb;
        }
        else{
            cout<<c[2]*aa+c[1]*bb;
        }
        return 0;
        
        
    }
    else if(n<=10){
        dfs(1,0,0,0);
        cout<<ans;
        
        
        
    }
    else cout<<-1;
    return 0;
}