Binary Search

import java.util.Scanner;

public class Main{
    static int a[] = new int[100];
    static int s,n;
    public static void binary_search(int l, int h, int s){
        if(l==n||h<0) System.out.println("Not Found");
        else{
            int mid=(l+h)/2;
            if(a[mid]==s) System.out.println("Found");
            else if(a[mid]>s) binary_search(mid+1,h,s);
            else binary_search(l,mid-1,s);
        }
    }
    public static void main(String args[]){
        Scanner cin = new Scanner(System.in);
        while(cin.hasNext()){
            n = cin.nextInt();
            s = cin.nextInt();
            for(int i=0;i<n;i++) a[i] = cin.nextInt();
            binary_search(0,n-1,s);
        }
    }
}