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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import static java.lang.Math.abs;

public class B {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt();

		int n, s, p;
		for (int i = 1; i <= T; i++) {
			// read input
			n = in.nextInt(); s = in.nextInt();	p = in.nextInt();
			int[] googlers = new int[n];
			for (int j = 0; j < n; j++)
				googlers[j] = in.nextInt();

			// solve
			int ans = solve(n, s, p, googlers);
			System.out.println(ans);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}
		
		bw.close();
	}

	private static int solve(int n, int s, int p, int[] googlers) throws IOException {
		boolean[] surp = new boolean[n];
		boolean[] reach = new boolean[n];
		boolean[] both = new boolean[n];
		
		for (int T = 0; T < n; T++)
			for (int i = 0; i <= 10; i++)
				for (int j = i; j <= i+2 && j <= 10; j++)
					for (int k = j; k <= j+2 && j <= 10; k++)
						if (i+j+k == googlers[T] && check(i, j, k))
						{
							boolean a = isSurprising(i, j, k), b = reached(i, j, k, p);
							if(!surp[T]) surp[T] = a && !b;
							if(!reach[T]) reach[T] = b && !a;
							if(!both[T]) both[T] = a && b; 
						}
		
		int max = findMax(n, s, p, surp, reach, both);
		
		return max;
	}

	private static int findMax(int n, int s, int p, boolean[] surp,	boolean[] reach, boolean[] both) {
		
		int max = 0;
		for(int i = 0; i < n; i++)
			if(both[i] || reach[i])max++;
		
		int ss = 0;
		for(int i = 0; i < n; i++)
			if(surp[i] || both[i]) ss++;
		
		if(ss == s)
			return max;
		else // ss > s
		{
			for(int i = 0; i < n; i++)
				if(surp[i] || (both[i] && reach[i])) ss--;
			
			if(ss <= s)
				return max;
			else
				return max-(ss-s);
			
		}
	}

	private static boolean reached(int i, int j, int k, int p) {
		return Math.max(i, Math.max(j, k)) >= p;
	}

	private static boolean isSurprising(int i, int j, int k) {
		return abs(i - j) == 2 || abs(j - k) == 2 || abs(i - k) == 2;
	}

	private static boolean check(int i, int j, int k) {
		return abs(i - j) <= 2 && abs(j - k) <= 2 && abs(i - k) <= 2;
	}
}
