import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.util.*;

public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		int N, S, p;

		for (int x = 1; x <= T; x++) {
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();

			int[] t = new int[N];
			int y = 0;

			for (int i = 0; i < N; i++) {
				t[i] = in.nextInt();

				int k = t[i] / 3;
				int j1 = -1, j2 = -1, j3 = -1;
 
				// not surprising triplets
				if ((k + 1) + (k + 1) + k == t[i]) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k;
				}

				else if ((k + 1) + k + k == t[i]) {
					j1 = k + 1;
					j2 = k;
					j3 = k;
				}

				else if (3 * k == t[i]) {
					j1 = k;
					j2 = k;
					j3 = k;
				}

				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					continue;
				}

				if(S==0) continue;
				
				// surprising triplets
				if (k != 9 && (k + 2) + k + k == t[i]) {
					j1 = k + 2;
					j2 = k;
					j3 = k;
				} else if (k != 0 && ((k + 1) + (k + 1) + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k - 1;
				} else if (k != 0 && ((k + 1) + k + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k;
					j3 = k - 1;
				}
				
				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					S--;
					continue;
				}

			}

			System.out.println("Case #" + x + ": " + y);
		}
	}
}
