package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}


import java.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.OutputStreamWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.Writer;

public class Googledance {
	public static void main (String[] args) {
		FileReader fr = null;
		BufferedReader br = null;
		Writer out = null;
		Writer debug = null;
		try {
			fr = new FileReader(args[0]);
			br = new BufferedReader(fr);
			out = new OutputStreamWriter(new FileOutputStream("googledance-result.txt"));
			debug = new OutputStreamWriter(new FileOutputStream("googledance-debug.txt"));
			String numOfLine = br.readLine();
			int line = 0;
			if (numOfLine != null) {
				line = Integer.valueOf(numOfLine);
			} else {
				return;
			}

			String lineData;
			String[] danceArray;

			for (int i = 1; i <= line; i++) {
				String resultLine = "";
				lineData = br.readLine();
				danceArray = lineData.split(" ");
				int numOfGoogler = Integer.valueOf(danceArray[0]);
				int numOfSurprise = Integer.valueOf(danceArray[1]);
				int minSingleScore = Integer.valueOf(danceArray[2]);

				int googlerTotalScore = 0;
				int okCounter = 0;
				int surpriseCounter = 0;
				int kOk = 0, lOk = 0, mOk = 0;
				boolean okNumber = false;
				boolean surpriseNumber = false;
				for (int j = 3; j < 3 + numOfGoogler; j++) {
					okNumber = false;
					surpriseNumber = false;
					kOk = 0; lOk = 0; mOk = 0;
					googlerTotalScore = Integer.valueOf(danceArray[j]);
					if (minSingleScore >=2) {
						for (int k = minSingleScore - 2; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l = minSingleScore - 2; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore - 2; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					} else if (minSingleScore == 1) {
						for (int k = minSingleScore - 1; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l= minSingleScore - 1; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore - 1; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					} else if (minSingleScore == 0) {
						for (int k = minSingleScore; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l= minSingleScore; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");
						debug.write("\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					}
				}

				if (surpriseCounter > numOfSurprise) {
					okCounter = okCounter - (surpriseCounter - numOfSurprise);
				}

				resultLine = "Case #" + i + ": " + okCounter;

				debug.write("\n");
				out.write(resultLine);
				if (i != line) {
					out.write("\n");
				}
				System.out.println(resultLine);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				br.close();
				fr.close();
				out.close();
				debug.close();
			} catch(Exception e) {}
		}
	}
}
