public static void test(){
		//10 4
		//25 20 9 100
		BufferedReader br=null;
		try{
			String sCurrentLine;
			br=new BufferedReader(new FileReader("C:\\Users\\CPD02\\Downloads\\A-small-practice (1).in"));
			sCurrentLine="1";
			int testCase=Integer.parseInt(sCurrentLine);
			for(int i=1;i<=testCase;i++){
				String paras="2 4";
				stepsToNext=new ArrayList<Integer> (); 
				int currentValue=Integer.parseInt(paras.split(" ")[0]);
				//int otherValues=Integer.parseInt(paras.split(" ")[1]);
				String[] sotherMotes="2 1 1 6".split(" ");
				ArrayList<Integer>otherMotes=new ArrayList<Integer>();

				for(int j=0;j<sotherMotes.length;j++){
					otherMotes.add(Integer.parseInt(sotherMotes[j]));
				}
				Collections.sort(otherMotes);

				if(currentValue==1){
					System.out.println("Case #"+i+": "+otherMotes.size());
					continue;
				}else{

					for(int j =0;j<otherMotes.size();j++){


						currentValue=SetActionArray(currentValue,otherMotes.get(j),j);


					}
					int remove=0;
					int addSteps=0;
					int removeIndex=0;//numbers to remove from the end of array
					for(int j=stepsToNext.size()-1;j>0;j--){
						remove++;
						addSteps+=stepsToNext.get(j);
						if(remove<addSteps){
							removeIndex=remove;
							addSteps=remove;//because this is the smallest possible from end.
						}
					}
					System.out.println("Case #"+i+": "+addSteps);

				}
			}

		}catch(IOException e){
			e.printStackTrace();

		}finally{
			if(br!=null)
				try {
					br.close();
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
		}
	}