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.Arrays;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author alvin
 */
public class DancingWithTheGooglers implements Comparable<DancingWithTheGooglers> {
    
    public int a, b, c;
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int nTC = sc.nextInt();
        for (int tc = 1; tc <= nTC; tc++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            
            DancingWithTheGooglers skor[] = new DancingWithTheGooglers[n];
            for (int i = 0; i < n; i++) {
                skor[i] = new DancingWithTheGooglers(sc.nextInt());
            }
            
            Arrays.sort(skor);
            
            int hasil = 0;
            for (int i = 0; i < n; i++) {
                if (skor[i].a >= p || skor[i].b >= p || skor[i].c >= p) {
                    ++hasil;
                } else if (s > 0) {
                    if ((skor[i].a == skor[i].b) && (skor[i].a + 1 >= p) && (skor[i].b - 1 >= 0)) {
                        ++hasil;
                        --s;
                    } else if ((skor[i].b == skor[i].c) && (skor[i].b + 1 >= p) && (skor[i].c - 1 >= 0)) {
                        ++hasil;
                        --s;
                    }
                }
            }
            
            System.out.format("Case #%d: %d\n", tc, hasil);
        }
    }

    public DancingWithTheGooglers(int skor) {
        a = skor / 3;
        b = skor / 3;
        c = skor / 3;
        
        int sisa = skor - (a + b + c);
        if (sisa == 1) {
            ++a;
        } else if (sisa == 2) {
            ++a; ++b;
        }
    }

    @Override
    public int compareTo(DancingWithTheGooglers o) {
        if (a != o.a) {
            return (o.a - a);
        } else if (b != o.b) {
            return (o.b - b);
        } else if (c != o.c) {
            return (o.c - c);
        } else {
            return 0;
        }
    }
    
}

