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

public class DancingWithGooglers {

  public static class Googlers {

    public int T;
    public int surp;
    public boolean surprising;
    public boolean pSurprising;
    public boolean antiSurprising;
    public boolean pAntiSurprising;

    public Googlers(int T, int surp) {
      this.T = T;
      this.surp = surp;
    }

    public void set(int a, int b, int c) {
      if (c >= 0 && (a + b + c) == T) {
        int diff = (Math.max(a, Math.max(b, c)) - Math.min(a, Math.min(b, c)));
        if (diff <= 2) {
          if (diff == 2) {
            if (a >= surp || b >= surp || c >= surp) {
              pSurprising = true;
            } else {
              surprising = true;
            }
          } else {
            if (a >= surp || b >= surp || c >= surp) {
              pAntiSurprising = true;
            } else {
              antiSurprising = true;
            }
          }
        }
      }
    }
  }

  public static void main(String... args) throws IOException {
//    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
//    PrintWriter writer = new PrintWriter(System.out);
    PrintWriter writer = new PrintWriter("B-large.out");

    int len, cases = Integer.parseInt(reader.readLine());
    List<Googlers> satisfied = new ArrayList<Googlers>();
    List<Googlers> unsatisfied = new ArrayList<Googlers>();
    String[] inputs;
    int N, S, p;
    for (int i = 1; i <= cases; i++) {
      inputs = reader.readLine().split(" ");
      p = Integer.parseInt(inputs[1]);
      S = Integer.parseInt(inputs[2]);
      satisfied.clear();
      unsatisfied.clear();
      for (int j = 3; j < inputs.length; j++) {
        int t = Integer.parseInt(inputs[j]);
        Googlers googlers = new Googlers(t, S);

        for (int k = 0; k <= 10; k++) {
          int till = k + 2 > 10 ? 10 : k + 2;
          for (int l = k; l <= till; l++) {
            googlers.set(k, l, (t - (k + l)));
          }
        }
        if (googlers.pAntiSurprising) {
          satisfied.add(googlers);
        } else {
          unsatisfied.add(googlers);
        }
      }
      int pSurprising = 0;
      if (p > 0) {
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            pSurprising++;
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            iter.remove();
            pSurprising++;
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }

      if(p > 0){
        writer.print("Case #" + i + ": 0");
      }else {
        writer.print("Case #" + i + ": " + (satisfied.size() + pSurprising));
      }
      writer.println();
    }
    writer.flush();
  }


}

package qualification.problemb;

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.List;

public class ProblemB {

	private class Data {
		
		private int surpricing;
		private int minPoints;
		private List<Integer> points = new ArrayList<Integer>();
		
		public int getSurpricing() {
			return surpricing;
		}
		public void setSurpricing(int surpricing) {
			this.surpricing = surpricing;
		}
		public int getMinPoints() {
			return minPoints;
		}
		public void setMinPoints(int minPoints) {
			this.minPoints = minPoints;
		}
		public List<Integer> getPoints() {
			return points;
		}
		public void setPoints(List<Integer> points) {
			this.points = points;
		}
		
	}
	
	private List<Data> readFile(File f) {
		String nextLine = null;
		List<Data> result = null;

		try {
			BufferedReader reader = new BufferedReader(new FileReader(f));

			while ((nextLine = reader.readLine()) != null) {
				if (result == null) {
					result = new ArrayList<Data>();
				} else {
					String[] line = nextLine.split(" ");
					Data d = new Data();
					d.setSurpricing(Integer.parseInt(line[1]));
					d.setMinPoints(Integer.parseInt(line[2]));
					
					List<Integer> points = new ArrayList<Integer>();
					for(int i = 0; i < Integer.parseInt(line[0]); i++) {
						d.getPoints().add(Integer.parseInt(line[i + 3]));
					}
					
					result.add(d);
				}
			}

			reader.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		return result;

	}

	private List<Integer> solve(List<Data> data) {
		List<Integer> winners = new ArrayList<Integer>();
		for(Data d : data) {
			winners.add(getMaxWinnerForList(d));
		}
		
		return winners;
	}
	
	private int getMaxWinnerForList(Data data) {
		int winners = 0;
		int surpricing = 0;
		
		for(int point : data.getPoints()) {
			if(point < data.getMinPoints()) {
				continue;
			}
			
			if(point >= 3 * data.getMinPoints() - 2) {
				winners++;
			} else if(point >= 3 * data.getMinPoints() - 4) {
				surpricing++;
			}
		}
		
		winners += Math.min(data.getSurpricing(), surpricing);

		return winners;
	}
	
	private void writeToDisk(List<Integer> output) {
		File f = new File("outputBlarge.txt");
		
		try {
			BufferedWriter writer = new BufferedWriter(new FileWriter(f));
			int counter = 1;
			for(int s : output) {
				writer.write("Case #" + counter + ": " + s + "\n");
				counter++;
			}
			writer.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} 
		
	}

	
	public static void main(String[] args) {
		ProblemB c = new ProblemB();
		List<Data> structures = c.readFile(new File(args[0]));
		List<Integer> longs = c.solve(structures);
		c.writeToDisk(longs);
	}

	
}
