public class Solution {
public boolean Find(int target, int [][] array) {
int col=array[0].length-1;
int row=0;
boolean key=false;
while( row <= array.length-1 && col>= 0){
if(array[row][col]==target){
key=true;
break;
}
else if(array[row][col]>target){
--col;
}
else{
++row;
}
}
return key;
}
}