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 DancingWithTheGooglers {
    private PrintWriter out;
    private Scanner in;

    private void init() {
    }

    private void solve() {
        int N = in.nextInt();
        int S = in.nextInt();
        int p = in.nextInt();

        int r = 0;
        for (int i = 0; i < N; i++) {
            int best = in.nextInt();
            int part = best / 3;
            int rest = best - part * 3;
            // rest = 0,1,2 part=4
            // 0: 4 4 4->4 3 5; 4 (+1)
            // 1: 4 4 5->3 5 5; 5 (0)
            // 2: 4 5 5->4 4 6; 5 (+1)
            // part=0: +0
            // 0: 0 0 0->0 0 0; 0 (+0)
            // 1: 0 0 1->0 0 1; 1 (+0)
            // 2: 0 1 1->0 0 2; 1 (+1)
            // part=1: +0
            // 0: 1 1 1->1 0 2; 1 (+1)
            // 1: 1 1 2->1 1 2; 2 (+0)
            // 2: 1 2 2->1 1 3; 2 (+1)
            int max = part + (rest == 0 ? 0 : 1);
            int add = rest == 1 ? 0 : 1;
            if (part == 0) {
                add = rest == 2 ? 1 : 0;
            }
            if (S >= 1 && add == 1 && max + 1 == p) {
                S--;
                max += add;
            }
            if (max >= p) {
                r++;
            }
        }
        out.println(r);
    }

    private void runTests() {
        init();

        int T = Integer.parseInt(in.nextLine());
        for (int i = 0; i < T; i++) {
            out.print("Case #" + (i + 1) + ": ");
            solve();
        }
    }

    private void run() {
        try {
            runTests();
        } finally {
            close();
        }
    }

    private void close() {
        out.close();
        in.close();
    }

    public DancingWithTheGooglers() throws FileNotFoundException {
        this.in = new Scanner(new File("B-small-attempt2.in"));
        this.out = new PrintWriter(new File("B-small-attempt2.out"));
    }

    public static void main(String[] args) throws FileNotFoundException {
        new DancingWithTheGooglers().run();
    }
}
