//#define LOCAL

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 int dp[][], a[], b[];

 int _, n, x, y, kase = ;

 bool check(int t)

 {

     memset(dp, -, sizeof(dp));

     dp[][] = ;

     for(int i = ; i <= n; ++i)

     {

         if(dp[i][x] >= y)    return true;

         for(int j = ; j <= x; ++j)

         {

             if(dp[i - ][j] != -)

             {

                 int temp = min(t/a[i], x-j);    //枚举第i个人可以做的A任务的个数

                 for(int k = ; k <= temp; ++k)

                 {

                     int t1 = (t - a[i] * k) / b[i];    //计算第i个人做k件A任务，所能做的B任务的个数

                     dp[i][j + k] = max(dp[i][j + k], dp[i - ][j] + t1);    //选最优解

                 }

             }

         }

     }

     if(dp[n][x] >= y)    return true;

     return false;

 }

 int main(void)

 {

     #ifdef LOCAL

         freopen("3433in.txt", "r", stdin);

     #endif

     scanf("%d", &_);

     while(_--)

     {

         scanf("%d%d%d", &n, &x, &y);

         for(int i = ; i <= n; ++i)

             scanf("%d%d", &a[i], &b[i]);

         int l = , r = a[] * x + b[] * y;

         int ans = r;

         while(l <= r)

         {

             int mid = (l + r) >> ;

             if(check(mid))

             {

                 ans = mid;

                 r = mid - ;

             }

             else    l = mid + ;

         }

         printf("Case %d: %d\n", ++kase, ans);

     }

     return ;

 }