package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

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-small-attempt0.in"));
    PrintWriter pw = new PrintWriter(new FileWriter("B-small-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();
  }
}