package googlers;

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Googlers {
	
	public static void main(String[] args) {
		
		int n,s,p,count=0,t;		
		Scanner sin=new Scanner(System.in);
		
		t=Integer.parseInt(sin.nextLine());
		
		
		int result[]=new int[t];
		int j=0;
		
		if(t>=1 && t<=100)
		{
		for (int k = 0; k < t; k++) {
		count=0;	
		
			
        String ip = sin.nextLine();
        
        String[]tokens=ip.split(" ");
		
		
		n=Integer.parseInt(tokens[0]);
		s=Integer.parseInt(tokens[1]);
		p=Integer.parseInt(tokens[2]);
		
		if( (s>=0 && s<=n) && (p>=0 && p<=10) )
		{
		int[] total=new int[n];
		
		
		for (int i = 0; i < n; i++)
        {
            total[i] = Integer.parseInt(tokens[i+3]);
        }
		
		Comparator comparator=new PointComparator();
		PriorityQueue pq=new PriorityQueue<Point>(1, comparator);
		
		for (int i = 0; i < n; i++)
		{
			
			int x=total[i]/3;
			int r=total[i]%3;
			if(x>=p)
				count++;
			else if(x<(p-2))
				continue;
			else
			{
				//System.out.println("enter "+x+" "+(p-2));
				if(p-x==1)
				{
					Point temp=new Point();
					temp.q=x;
					temp.r=r;
					pq.add(temp);
				}
				else  // p-x=2
				{
					if(r==0)
						continue;
					else
					{
						Point temp=new Point();
						temp.q=x;
						temp.r=r;
						pq.add(temp);
					}				
					
				}
					
			}
			//System.out.println("hi "+pq.size());
			
		}
		
		
		
		while(pq.size()!=0)
		{
			Point temp=(Point)pq.remove();
			if(p-temp.q==1 && temp.q!=0)
			{
				if(temp.r>=1)
					count++;
				else
				{
					if(s!=0)
					{
						s--;
						count++;
					}
				}
			}
			else if(p-temp.q==2)
			{
				if(s!=0 && (temp.q+temp.r)>=p)
				{
					s--;
					count++;
				}
			}
			
				
		}
		
		//System.out.println(p);
		
		result[j++]=count;
		
		}
		}
		
		for (int i = 0; i < t; i++) 
		{
			System.out.println("Case #"+(i+1)+": "+result[i]);
		}
		}
		
	}
        
        
		
		/*Point x=new Point();
		x.q=8;
		Point y=new Point();
		y.q=6;
		Point z=new Point();
		z.q=7;
		
		pq.add(x);
		pq.add(y);
		pq.add(z);
		*/
		
		
		
		
	

}

class PointComparator implements Comparator<Point>
{
    @Override
    public int compare(Point x, Point y)
    {
        // Assume neither string is null. Real code should
        // probably be more robust
        if (x.q < y.q)
        {
            return 1;
        }
        if (x.q  > y.q)
        {
            return -1;
        }
        return 0;
    }
}



class Point
{
	int q,r;

	public int getQ() {
		return q;
	}

	public void setQ(int q) {
		this.q = q;
	}

	public int getR() {
		return r;
	}

	public void setR(int r) {
		this.r = r;
	}
	
	
}

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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

public class DancingGooglers {

    private int T;//number of testcases
    private int N;//number of googlers
    private int S;//number of surprising triplets of scores
    private int p;//best result for each case
    private int[] scores;
    private int ti;//score for each googler
    private Scanner input;
    //method to calculate maximum number of googlers

    public void openFile() {
        Scanner cin = new Scanner(System.in);
        System.out.println("Enter File Path containing test data: ");
        String filePath = cin.nextLine();
        try {
            input = new Scanner(new File(filePath));
        } catch (FileNotFoundException ex) {
            System.err.println("Error opening file!");
            System.exit(1);
            Logger.getLogger(DancingGooglers.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
//small input

    public void readFile() {

        if (input.hasNext()) {
            //read number of test cases
            T = input.nextInt();
            //enforce T limit 

            //move to first case
            int test_count = 0;
            input.nextLine();
            //for each test case read N, S, p, and N values to array ti and call output method
            while (input.hasNext() && (test_count <= T)) {
                test_count++;
                N = input.nextInt();
                //proceed for this input
                S = input.nextInt();
                p = input.nextInt();
                scores = new int[N];
                //populate scores
                for (int i = 0; i < N; i++) {
                    scores[i] = input.nextInt();
                }
                Arrays.sort(scores);
                //call output method
                output(test_count, S, p, scores);
            }

        }
    }

    public void closeFile() {
        input.close();
    }

    public void output(int test_case, int surprises, int best_result, int[] scores) {
        if (p > 1) {
            int q = p * 3 - 2;
            int s = p * 3 - 4;
            int count = 0;
            int pt = N - 1;

            for (int i = N - 1; i >= 0; i--) {
                if (scores[i] >= q) {
                    count++;
                    pt--;
                }
            }
            while (pt >= 0 && scores[pt] >= s && S > 0) {
                count++;
                pt--;
                S--;
            }
            System.out.println("Case #" + test_case + ": " + count);
        } else if (p == 1) {
            int j = 0;
            for (j = 0; j < N; j++) {
                if (scores[j] > 0) {
                    break;
                }
                
            }
            System.out.println("Case #" + test_case + ": " + (N - j));
        } else if (p == 0) {
            System.out.println("Case #" + test_case + ": " + N);
        }
    }

    public static void main(String[] str) {
        DancingGooglers dG = new DancingGooglers();
        dG.openFile();
        dG.readFile();
        dG.closeFile();
    }
}
