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.*;
import java.io.*;

public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		new Dancing().run();
	}

	Integer[] best = new Integer[31];
	int best(int x) {
		if (best[x] != null)
			return best[x];
		for (int l = 0; l <= Math.min(x, 8); l++) {
			for (int m = l; m <= l + 2 && m + l <= x; m++) {
				int h = l + 2;
				if (l + m + h == x) {
					best[x] = h;
				}
			}
		}
		if (best[x] == null)
			best[x] = -1;
		return best[x];
	}
	
	void run() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		
		for (int i = 0; i <= 30; i++)
			System.err.println("" + i + "," + best(i) + "," + ((i + 2) / 3));
		
		int T = nextInt();
		for (int tt = 0; tt < T; tt++) {
			int n = nextInt(), s = nextInt(), p = nextInt();
			
			int ans = 0;
			ArrayList<Integer> list = new ArrayList<Integer>();
			for (int i = 0; i < n; i++) {
				int x = nextInt();
				if (x < 2) {
					if (x >= p)
						ans++;
				} else if (x > 28) {
					ans++;
				} else {
					list.add(x);
				}
			}
			
			Integer[] arr = new Integer[0];
			arr = list.toArray(arr);
			
			Arrays.sort(arr);
			
			int rem = s;
			for (int i = 0; i < arr.length; i++) {
				int x = arr[i];
				if (best(x) >= p && (x + 2) / 3 < p && rem > 0) {
					ans++;
					rem--;
				} else if ((x + 2) / 3 >= p) {
					ans++;
				}
			}
			
			System.out.println("Case #" + (tt + 1) + ": " + ans);
		}
		
		out.close();
	}
	
	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;
	
	String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine());
		}
		return st.nextToken();
 	}
	
	int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	
}
