#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

long long gcd(long long a, long long b){ return (b==0)?a:gcd(b,a%b); }
template<class ... T> long long gcd(long long a, long long b, T ... c){ return gcd(gcd(a,b), c...);}
long long lcm(long long a, long long b){ if(a<b) swap(a,b); return (b==1)?a:a*(b/gcd(a,b)); }
template<class ... T> long long lcm(long long a, long long b, T ... c){ return lcm(lcm(a,b), c...);}

long long extgcd(long long a, long long b, long long &x, long long &y){
  long long d=a;
  if(b!=0){
    d = extgcd(b, a%b, y, x);
    y -= (a/b) * x;
  }else{
    x = 1;
    y = 0;
  }
  return d;
}

int main(){
  int n,x,y;
  cin >> n,x,y;

  vector<int> a(n),b(n),c(n);
  for(auto i : range(n) ){
    cin >> a[i],b[i],c[i];
  }

  if(n<=20){
    int ans = 1e8;
    for(int s=1; s<(1<<n); s++){
      int cc = 0;
      int aa = 0, bb = 0;
      for(auto i : range(n) ){
        if((~s>>i)&1) continue;
        aa += a[i];
        bb += b[i];
        cc += c[i];
      }

      int g = gcd(aa,bb);
      aa /= g;
      bb /= g;
      if( aa==x && bb==y ){
        ans = min(ans, cc);
      }
    }

    if(ans == 1e8){
      println(-1);
    }else{
      println(ans);
    }
    return 0;
  }

  long long ans = 1e8;
  
  vector<vector<long long>> l(401, vector<long long>(401, 1e8));
  vector<vector<long long>> r(401, vector<long long>(401, 1e8));

  eprintln("pre comp 1");
  for(int s=1; s<(1<<20); s++){
    long long cc = 0;
    long long aa = 0, bb = 0;
    for(auto i : range(20) ){
      if((~s>>i)&1) continue;
      aa += a[i];
      bb += b[i];
      cc += c[i];
    }

    l[aa][bb] = min(l[aa][bb], cc);

    if(aa * y == bb * x){
      ans = min(ans, cc);
    }
  }
  eprintln(ans);

  eprintln("pre comp 2");
  int k = n-20;
  for(int s=1; s<(1<<k); s++){
    long long cc = 0;
    int aa = 0, bb = 0;
    for(auto i : range(k) ){
      if((~s>>i)&1) continue;
      aa += a[i+20];
      bb += b[i+20];
      cc += c[i+20];
    }

    r[aa][bb] = min(r[aa][bb], cc);

    if(aa * y == bb * x){
      ans = min(ans, cc);
    }
  }
  eprintln(ans);

  eprintln("comp");
  for(int aa=1; aa<=400; aa++) for(int bb=1; bb<=400; bb++){
    long long cc = r[aa][bb];
    if(cc >= 1e8) continue;

    for(int da=1; da+aa<=400; da++){
      int sa = da+aa;
      if(sa*y % x != 0) continue;
      int sb = sa * y / x;
      int db = sb - bb;
      if(db <= 0 || db>=400) continue;

      if(l[da][db] >= 1e8) continue;
      long long ccc = cc + l[da][db];
      ans = min(ans, ccc);
    }
  }
  eprintln(ans);

  if(ans >= 1e8) ans = -1;
  println(ans);

  return 0;
}


Measured memory_bytes: 2816