package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.*;
/**
 *
 * @author ankush
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args)throws IOException {
        //System.out.println(Math.floor(Math.log10(11)));
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int t=Integer.parseInt(br.readLine());
        int ans[]=new int[t];
        for(int i=0;i<t;i++)
        {
            String x=br.readLine();
            String r[]=new String[250];
            r=x.split(" ");
            int n=Integer.parseInt(r[0]);
            int s=Integer.parseInt(r[1]);
             int p=Integer.parseInt(r[2]);
            int count=0;
            int arr[]=new int[n];
            for(int j=0;j<n;j++)
            {
                arr[j]=Integer.parseInt(r[j+3]);
            }
            int pos[]=new int[n];
            for(int j=0;j<n;j++)
            {
                int max=0,a=0,b=0,c=0;
                for(a=p;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)<2 && Math.abs(a-c)<2 && Math.abs(c-b)<2)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && pos[j]!=1)
                           {
                               count++;
                               pos[j]=1;
                           //  System.out.println(arr[j]+" "+a+" "+b+" "+c);
                             a=100;b=100;
                            break;
                           }
                        }
                     }
                }
                if(a==11)
                {
                for(a=p;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)<3 && Math.abs(a-c)<3 && Math.abs(c-b)<3)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && s>0 && pos[j]!=1)
                           {
                               s--;
                               count++;
                               pos[j]=1;
                             // System.out.println(arr[j]+" "+a+" "+b+" "+c+" "+s);
                             a=11;b=11;
                             break;
                           }
                        }
                    }
                }
                }

            }/*
              if(s>0)
                {
              for(int j=0;j<n;j++)
                {
                  if(pos[j]==1)
                  {
                 int max=0,a=0,b=0,c=0;
                for(a=0;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(c-b)==2)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && pos[j]==1)
                           {
                               s--;
                            //  System.out.println(arr[j]+" "+a+" "+b+" "+c);
                             a=100;b=100;
                             break;
                           }
                        }
                     }
                }
                    }
                }
              }*/
            ans[i]=count;
           //System.out.println(x+" "+ans[i]+" "+s);
            
    }
 for(int i=0;i<t;i++)
        {
            System.out.println("Case #"+(i+1)+": "+ans[i]);
        }
}
}