/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.util.HashMap;
import java.util.Map;

public class ProblemB {
	public static void main(String argv[])
	{
		IOSystem ioSystem = new IOSystem("problem/B-small-attempt0");
////		IOSystem ioSystem = new IOSystem("problem/A-small-attempt2");
//		IOSystem ioSystem = new IOSystem("problem/test");

		ioSystem.nextLong();
		while(ioSystem.hasNext())
		{
			int N = ioSystem.nextInt();
			int S = ioSystem.nextInt();
			int P = ioSystem.nextInt();

			int koeru = 0;
			int supKoeru = 0;

			for(int i=0;i<N;i++)
			{
				int t = ioSystem.nextInt();
				if(t==0)
				{
					if(P == 0)koeru++;
					continue;
				}
				if(t==1)
				{
					if(P <= 1)koeru++;
					continue;
				}



				//3ã¤ã«åãã
				if(t%3==0)
				{
					if(t/3>= P)
					{
						koeru++;
					}
					else if(t/3 + 1>= P)
					{
						supKoeru++;
					}
				}
				else if(t%3 == 2)
				{
					if(t/3 + 1>= P)
					{
						koeru++;
					}
					else if(t/3 + 2>= P)
					{
						supKoeru++;
					}
				}
				else
				{
					if(t/3 + 1 >= P)
					{
						koeru++;
					}
				}
			}

			System.out.println(N+","+S+","+P+","+koeru+","+supKoeru);

			if(supKoeru > S)
			{
				koeru += S;
			}
			else
			{
				koeru += supKoeru;
			}


			ioSystem.appendAnswer(koeru);
		}

		ioSystem.output();
	}
}


