using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{
    static void Main(string[] args)
    {
        new Magatro().Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;

    private string[] S;
    private int Index;
    private const char Separator = ' ';

    public Scanner(Stream source)
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(source);
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public decimal NextDecimal()
    {
        return decimal.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    private Scanner Cin;
    private int N, Ma, Mb;
    private int[] a, b, c;

    private List<int>[] L;
    private void Scan()
    {
        Cin = new Scanner(Console.OpenStandardInput());
        N = Cin.NextInt();
        Ma = Cin.NextInt();
        Mb = Cin.NextInt();
        a = new int[N];
        b = new int[N];
        c = new int[N];
        for (int i = 0; i < N; i++)
        {
            a[i] = Cin.NextInt();
            b[i] = Cin.NextInt();
            c[i] = Cin.NextInt();
        }
    }

    public void Solve()
    {
        Scan();
        int[,,] dp;
        int asum = a.Sum();
        int bsum = b.Sum();
        dp = new int[asum + 1, bsum + 1,N+1];
        for (int i = 0; i <=asum; i++)
        {
            for (int j = 0; j <= bsum; j++)
            {
                for (int k = 0; k <= N; k++)
                {


                    dp[i, j,k] = int.MaxValue;
                }
            }
        }
        dp[0, 0, 0] = 0;
        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j <= asum; j++)
            {
                for (int k = 0; k <= bsum; k++)
                {
                    if (dp[j, k, i] != int.MaxValue)
                    {
                        dp[j, k, i + 1] = Math.Min(dp[j, k, i], dp[j, k, i + 1]);
                        if (j + a[i] > asum || k + b[i] > bsum) continue;
                        dp[j + a[i], k + b[i], i + 1] = Math.Min(dp[j + a[i], k + b[i], i + 1], dp[j, k, i] + c[i]);
                    }
                }
            }
        }
        bool flag = false;
        int ans = int.MaxValue;
        for (int i = 1; i <= asum; i++)
        {
            if ((i * Mb) % Ma != 0) continue;
            int j = i * Mb / Ma;
            if (j >= bsum) continue;

            if (dp[i, j, N] != int.MaxValue)
            {
                ans = Math.Min(ans, dp[i, j, N]);
             //   Console.WriteLine($"{i} {j}");
                flag = true;
            }
        }
        if (flag)
        {
            Console.WriteLine(ans);
        }
        else
        {
            Console.WriteLine(-1);
        }
    }
}






Measured memory_bytes: 22240