def binary_search(arr,x,left,right):
    while(left<=right):
        mid=left +(right-left)//2

        if(arr[mid]==x):
            return mid

        elif (arr[mid] < x):
            left=mid+1

        else:
            right=mid-1
    return -1