public static int getFirstK(int[] array,int start,int end,int k){
		if(start > end){
			return -1;
		}
		int midPos = start + (end - start)/2;
		int midData = array[midPos];
		if(midData == k){
			if( (midPos != 0 && array[midPos-1] != k )|| midPos == 0){
				return midPos;
			}else{
				end = midPos -1;
			}
			
		}
		else if(midData > k){
			end = midPos - 1;
		}else{
			start = midPos + 1;
		}
		return getFirstK(array,start,end,k);
		
	}