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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner s=new Scanner(new File("./data/B.txt"));
		PrintWriter pw=new PrintWriter(new File("./data/B_sol.txt"));
		int nCases=s.nextInt();s.nextLine();
		for(int i=0;i<nCases;i++){
			int N=s.nextInt();
			int S=s.nextInt();
			int P=s.nextInt();
			int count=0;
			
			for(int j=0;j<N;j++){
				int T=s.nextInt();
				
				boolean ok=false;
				for(int a=0;a<=10 &&!ok;a++){
					for(int b=0;b<=10&&!ok;b++){
						for(int c=0;c<=10&&!ok;c++){
							if(a+b+c==T && Math.abs(a-b)<=1 && Math.abs(a-c)<=1 && Math.abs(b-c)<=1
									&& (a>=P || b>=P || c>=P))
							{
								ok=true;
								System.out.println(a+" "+b+" "+c+" = "+T);
								
							}
						}
					}
				}
				if(ok)
					count++;
				else
				{
					boolean ok_2=false;
					for(int a=0;a<=10&&!ok_2;a++)
					{
						for(int b=0;b<=10&&!ok_2;b++){
							for(int c=0;c<=10&&!ok_2;c++)
							{
								if(a+b+c==T && Math.abs(a-b)<=2 && Math.abs(a-c)<=2 && Math.abs(b-c)<=2
										&& (a>=P || b>=P || c>=P))
								{
									ok_2=true;
									System.out.println(a+" "+b+" "+c+" = "+T);
								}
										
							}
						}
					}
					if(ok_2 && S>0){
						S--;
						count++;
					}
				}
				
			}
			pw.println("Case #"+(i+1)+": " +count);
			System.out.println("->"+i);
		}
		pw.close();
	}
}
