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.io.*;
import java.util.*;
import static java.lang.Math.*;

public class B {
  public static void main(String[] args) throws Exception {
    Scanner sc = new Scanner(new FileReader("B-large.in"));
    PrintWriter pw = new PrintWriter(new FileWriter("B-large-output.txt"));
    int T = sc.nextInt();       // number of test cases
    int numResult;
    for (int k=1; k <= T; k++) {
      numResult = 0;
      
      int N = sc.nextInt();     // number of Googlers
      int B = sc.nextInt();     // number of surprising triplet scores
      int p = sc.nextInt();     // "best result" (max of triplets)
      int t[] = new int[N];     // total points for a given Googler (b/t 0 & 30)
      
      int minInd[] = new int[B];
      int minCount = 0;
      
      for (int i=0; i<N; i++) {    // for each of the Googler's total points
        t[i] = sc.nextInt();
      }
      Arrays.sort(t);           // can then start w/ lowest total score
      
      int surpriseCount = 0;    // counts the num of surprising triplets used
      
      for (int i=0; i<N; i++) {    
        // check possible scores:
        if (surpriseCount<B) {
          firstScore: for (int num1=0; num1<11; num1++) {
            for (int num2=min(num1+2,10); num2>=num1; num2--) {
              for (int num3=min(num1+2,10); num3>=num1; num3--) {
                if ((num1+num2+num3)==t[i]) {
                  if (max(num2, num3)>=p) {
                    if (max(num2, num3) > (num1+1)) {
                      surpriseCount++;
                    }
                    numResult++;
                    break firstScore;
                  }
                }
              }
            }
          }
        } else {
          firstScore: for (int num1=0; num1<11; num1++) {
            for (int num2=min(num1+1,10); num2>=num1; num2--) {
              for (int num3=min(num1+1,10); num3>=num1; num3--) {
                if ((num1+num2+num3)==t[i]) {
                  if (max(num2, num3)>=p) {
                    numResult++;
                    break firstScore;
                  }
                }
              }
            }
          }
        }
      }
      pw.format("Case #%d: %d\n", k, numResult);
    }
    
    pw.flush();
    pw.close();
    sc.close();
  }
}