import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Dancing {

	
	public static void main(String[] args) throws IOException 
	{
		File file = new File("B-large.in");
		Scanner scanner;
		BufferedWriter out = new BufferedWriter(new FileWriter("outfile"));
		
		try
		{
			scanner = new Scanner(file);
			int testCases = scanner.nextInt();
			scanner.nextLine();  
			
			for(int numTest=0; numTest<testCases; numTest++)
			{
				int N = scanner.nextInt();
				int S = scanner.nextInt();
				int P = scanner.nextInt();
				int[] total = new int[N];
				for(int i=0; i<N; i++)
				{
					total[i]=scanner.nextInt();
				}
				
				scanner.nextLine();
				
				int count=0;
				for(int i=0; i<N; i++)
				{
					if(total[i]==0)
					{
						if(P==0)
							count++;
					}
					else if(total[i]<=3)
					{
						if(P<=1)
							count++;
					}
					else
					{
					
						int avg = total[i]/3;
						int mod = total[i]%3;
						if(mod==0)
						{
							if(avg>=P)
								count++;
							else
							{
								if((avg+1>=P)&&(S>0))
								{
									count++;
									S--;
								}
							}
						}
						if(mod==1)
						{
							if(avg+1>=P)
								count++;
						}
						if(mod==2)
						{
							if(avg+1>=P)
								count++;
							else
							{
								if((avg+2>=P)&&(S>0))
								{
									count++;
									S--;
								}
							}
						}	
					}
				}
				out.write("Case #"+(numTest+1)+": "+ count +"\n");
			}
			
			out.close();
		}
		catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
	}
}
