package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;

public class CodeJam
{
    private static BufferedReader reader;
    private static BufferedWriter writer;
    
    public static void main(String args[]) throws Exception
    {
        prepareFiles("B-small-attempt2");
        
        int T = Integer.parseInt(reader.readLine());
     
        for(int i = 0; i < T; i++)
        {
            String[] line = reader.readLine().split(" ");
            
            int N = Integer.parseInt(line[0]); // # of googlers
            int S = Integer.parseInt(line[1]); // # of suprising triplets
            int p = Integer.parseInt(line[2]); // best result of at least p
            
            int maxTopScorers = 0;
            
            ArrayList<Case> surprisingCases = calulate(N, line, p, true);
            ArrayList<Case> normalCases = calulate(N, line, p, false);
            
            ArrayList<ArrayList<Case>> permutations = new ArrayList<ArrayList<Case>>();
            permutate(new ArrayList<Case>(), surprisingCases, permutations);
            
            for(int j = 0; j < permutations.size(); j++)
            {
                int topScorers = 0;
                HashSet<Case> topScorersCases = new HashSet<Case>();
                
                ArrayList<Case> suprisingPermutation = permutations.get(j);
                
                for(int k = 0; k < suprisingPermutation.size() && k < S; k++)
                {
                    topScorersCases.add(suprisingPermutation.get(k));
                    topScorers ++;
                }
                
                for(int k = 0; k < normalCases.size(); k++)
                {
                    if(!topScorersCases.contains(normalCases.get(k)))
                    {
                        topScorers ++;
                    }
                }
                
                if(topScorers > maxTopScorers)
                {
                    maxTopScorers = topScorers;
                }
            }
            
            print(getCase(i + 1));
            print(maxTopScorers);
            //print(" " + Arrays.toString(line));
            print("\n");
        }
        
        putAwayFiles();
    }
    
    private static void permutate(ArrayList<Case> head, List<Case> tail, ArrayList<ArrayList<Case>> permutations) throws Exception
    {
        if(tail.size() == 0)
        {
            permutations.add(head);
            return;
        }
        else
        {
            for(int i = 0; i < tail.size(); i++)
            {
                ArrayList<Case> newHead = new ArrayList<Case>();
                newHead.addAll(head);
                newHead.add(tail.get(i));
                
                permutate(newHead, joinLists(tail.subList(0, i), tail.subList(i + 1, tail.size())), permutations);
            }
        }
    }
    
    private static List<Case> joinLists(List<Case> list1, List<Case> list2)
    {
        ArrayList<Case> list = new ArrayList<>();
        
        list.addAll(list1);
        list.addAll(list2);
        
        return list;
    }
    
    private static ArrayList<Case> calulate(int N, String[] line, int p, boolean surprising)
    {
        ArrayList<Case> cases = new ArrayList<Case>();
        
        for(int j = 0; j < N; j++)
        {
            boolean actuallySurprising = false;
            int t = Integer.parseInt(line[3 + j]); // total points for this googler
            
            int basePoints = t/3;
            int extraPoints = t%3;
            int maxPoints = 0;
            
            if(surprising)
            {
                if(extraPoints == 0 && basePoints > 0)
                {
                    maxPoints = basePoints + 2;
                    actuallySurprising = true;
                }
                else if(extraPoints > 0)
                {
                    maxPoints = basePoints + extraPoints;
                    
                    if(extraPoints == 2)
                    {
                        actuallySurprising = true;
                    }
                }
                else
                {
                    maxPoints = basePoints;
                }
                
                if(actuallySurprising && maxPoints >= p)
                {
                    Case pointCase = new Case(j, maxPoints, true);
                    cases.add(pointCase);
                }
            }
            else
            {
                if(extraPoints > 0)
                {
                    maxPoints = basePoints + 1;
                }
                else
                {
                    maxPoints = basePoints;
                }
                
                if(maxPoints >= p)
                {
                    Case pointCase = new Case(j, maxPoints, false);
                    cases.add(pointCase);
                }
            }
        }
        
        
        Collections.sort(cases, new Comparator<Case>()
        {
            @Override
            public int compare(Case arg0,
                               Case arg1)
            {
                return arg1.maxPoints - arg0.maxPoints;
            }
        });
        
        return cases;
    }
    
    private static void prepareFiles(String fileName) throws IOException
    {
        reader = new BufferedReader(new FileReader(new File(fileName + ".in")));
        writer = new BufferedWriter(new FileWriter(new File(fileName + ".out")));
    }
    
    private static void putAwayFiles() throws IOException
    {
        reader.close();
        writer.flush();
        writer.close();
    }
    
    private static String getCase(int i)
    {
        return "Case #" + i + ": ";
    }
    
    private static void print(Object object) throws IOException
    {
        System.out.print(object.toString());
        writer.write(object.toString());
    }
    
    private static class Case
    {
        private int caseNumber;
        private int maxPoints;
        private boolean surprising;
        
        public Case(int caseNumber,
                    int maxPoints,
                    boolean surprising)
        {
            this.caseNumber = caseNumber;
            this.maxPoints = maxPoints;
            this.surprising = surprising;
        }
        
        @Override
        public boolean equals(Object o)
        {
            return ((Case)o).caseNumber == caseNumber;
        }
        
        @Override
        public int hashCode()
        {
            return caseNumber;
        }
        
        @Override
        public String toString()
        {
            return caseNumber + ":" + maxPoints;
        }
    }
}


