import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class SolutionB_2 {

    public static void main(String[] args) throws IOException {

	String curDir = "DancingWithGooglers/";

	Scanner sc = new Scanner(new FileReader(curDir + "B-large.in"));
	PrintWriter pw = new PrintWriter(new FileWriter(curDir + "B-large.out"));

	int totalTestCase = Integer.parseInt(sc.nextLine());

	for (int testCase = 1; testCase <= totalTestCase; testCase++) {
	    Integer nGoogler = sc.nextInt();
	    Integer nSurprising = sc.nextInt();
	    Integer bestNum = sc.nextInt();

	    Integer maxNum = 0;
	    Integer nCheck = 0;

	    List<Integer> g = new ArrayList<Integer>();
	    List<Integer> g1 = new ArrayList<Integer>();

	    for (int i = 0; i < nGoogler; i++) {
		Integer a = sc.nextInt();
		g.add(a);
		g1.add(a);
	    }

	    if (nSurprising == 0) {
		for (Integer t : g) {
		    int y = t / 3;
		    int z = t % 3;

		    if (t == 0 || t == 1) {
			if (t >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 0) {
			if (y >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 1) {
			if (y + 1 >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 2) {
			if (y + 1 >= bestNum) {
			    maxNum++;
			}
		    }
		}
	    } else {
		java.util.Collections.sort(g, new Comparator<Integer>() {
		    public int compare(Integer a, Integer b) {
			if (a > b) {
			    return 1;
			} else if (a < b) {
			    return -1;

			} else {
			    return 0;
			}
		    }
		});

		for (Iterator<Integer> it = g.iterator(); it.hasNext();) {
		    Integer t = it.next();

		    int y = t / 3;
		    int z = t % 3;

		    if (t == 0 || t == 1) {
			continue;
		    } else if (z == 0) {
			if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    } else if (z == 1) {
			if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    } else if (z == 2) {
			if (y + 2 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			} else if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    }
		}

		if (nCheck >= nSurprising) {
		    for (Integer t : g) {
			int y = t / 3;
			int z = t % 3;

			if (t == 0 || t == 1) {
			    if (t >= bestNum) {
				maxNum++;
			    }
			} else if (z == 0) {
			    if (y >= bestNum) {
				maxNum++;
			    }
			} else if (z == 1) {
			    if (y + 1 >= bestNum) {
				maxNum++;
			    }
			} else if (z == 2) {
			    if (y + 1 >= bestNum) {
				maxNum++;
			    }
			}
		    }
		}

	    }

	    pw.println(String.format("Case #%d: %d", testCase, maxNum));
	    System.out.println(String.format("Case #%d: %d, %d, %s => %d", testCase, nSurprising, bestNum, g1.toString(), maxNum));
	}

	pw.flush();
	pw.close();
	sc.close();
    }
}
