#include<iostream>
#include<cstring>
#define int long long
using namespace std;
int n,x,y,f[1005][1005],f2[1000005];
struct node{
    int x,y,c;
}a[95];
signed main(){
    freopen("tioj_constructive.in","r",stdin);
    freopen("tioj_constructive.out","w",stdout);
    scanf("%lld%lld%lld",&n,&x,&y);
    for(int i=1;i<=n;i++){
        scanf("%lld%lld%lld",&a[i].x,&a[i].y,&a[i].c);
    }
    if(n==2&&a[1].x==0&&a[1].y==1&&a[2].x==1&&a[2].y==0){
        printf("%lld",x*a[2].c+y*a[1].c);
    }
    else{
        if(x<=1000&&y<=1000){
            memset(f,0x3f,sizeof(f));
            f[0][0]=0;
            for(int k=1;k<=n;k++){
                for(int i=a[k].x;i<=x;i++){
                    for(int j=a[k].y;j<=y;j++){
                        f[i][j]=min(f[i][j],f[i-a[k].x][j-a[k].y]+a[k].c);
                    }
                }
            }
            printf("%lld",(f[x][y]==0x3f3f3f3f3f3f3f3f)?-1ll:f[x][y]);
        }
        else{
            memset(f2,0,sizeof(f2));
            f2[0]=0;
            for(int i=1;i<=n;i++){
                for(int j=a[i].x;j<=x;j++){
                    f2[j]=min(f2[j],f2[j-a[i].x]+a[i].c);
                }
            }
            printf("%lld",(f2[x]==0x3f3f3f3f3f3f3f3f)?-1ll:f2[x]);
        }
    }
    return 0;
}