package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}


/**
 * Write a description of class solver here.
 * 
 * @author (your name) 
 * @version (a version number or a date)
 */
public class solver
{
   public int solve(int nog,int nos,int p,int t[])
   {
       int[] aux=new int[2*nog];
       int i=0,count=0;
       for(i=0;i<nog;i++)
       {   
               if(t[i]==0)
               {
                 aux[i]=0;
                 aux[nog+i]=-1;
                }
               else if(t[i]==1)
               {
                 aux[i]=1;
                 aux[nog+i]=-1;
                }
                
               else if(t[i]==29)
               {
                 aux[i]=10;
                 aux[nog+i]=-10;
                }
               else if(t[i]==30)
               {
                 aux[i]=10;
                 aux[nog+i]=-10;
                }
                else if(t[i]%3==0)
                {
                    aux[i]=t[i]/3;
                    aux[nog+i]=t[i]/3+1;
                }
                else if(t[i]%3==1)
                {
                    aux[i]=t[i]/3+1;
                    aux[nog+i]=-1;
                }
                else
                {
                    aux[i]=t[i]/3+1;
                    aux[nog+i]=t[i]/3+2;
                }
                
       }
       for(i=0;i<nog;i++)
       {
           if(aux[i]>=p)
           {
               count++;
               aux[nog+i]=-1;
            }
        }
        for(i=0;i<nog;i++)
        {
            if(nos==0)
            break;
            else if(aux[i+nog]>=p)
            {
                   nos-=1;
                   count++;
            }
        }
        return count;
       
    }
}