/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package IO;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
    
/**
 * 
 * @author dannocz
 */
public class InputReader {
    
    public static Input readFile(String filename){
        try {
              
              /*  Sets up a file reader to read the file passed on the command
          77        line one character at a time */
              FileReader input = new FileReader(filename);
              
              /* Filter FileReader through a Buffered read to read a line at a
                 time */
              BufferedReader bufRead = new BufferedReader(input);
              
              String line;    // String that holds current file line
              int count = 0;  // Line number of count 
              ArrayList<String> cases= new ArrayList<String>();
              
              // Read first line
              line = bufRead.readLine();
              int noTestCases=Integer.parseInt(line);
              count++;
              
              // Read through file one line at time. Print line # and line
              while (count<=noTestCases){
                  //System.out.println("Reading. "+count+": "+line);
                  line = bufRead.readLine();
                  cases.add(line);
                  count++;
              }
              
              bufRead.close();
              
              return new Input(noTestCases,cases);
              
          }catch (ArrayIndexOutOfBoundsException e){
              /* If no file was passed on the command line, this expception is
              generated. A message indicating how to the class should be
              called is displayed */
              e.printStackTrace();        
  
          }catch (IOException e){
              // If another exception is generated, print a stack trace
              e.printStackTrace();
          }
        
        return null;
          
      }// end main
    }


import java.util.Arrays;
import java.util.Scanner;

public class B {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int n = in.nextInt();
            int s = in.nextInt();
            int p = in.nextInt();
            int ans = 0;

            int a[] = new int[n];
            int b[] = new int[n];
            for (int j = 0; j < n; j++) {
                a[j] = in.nextInt();
                if (a[j] % 3 == 0) {
                    b[j] = a[j] / 3;
                } else if ((a[j] > 0) && (a[j] - 1) % 3 == 0) {
                    b[j] = (a[j] - 1) / 3 + 1;
                } else if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                    b[j] = (a[j] - 2) / 3 + 1;
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] < p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x >= p) {
                        ans++;
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] < p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x != -1) {
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x >= p) {
                        ans++;
                        a[j] = -1;
                        s--;
                    }
                }
            }

            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x != -1) {
                        ans--;
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    ans++;
                }
            }
            System.out.println("Case #"+(i+1)+": "+ans);
        }
    }
}
