# -*- coding:utf-8 -*-

class Solution:
    # array 二维列表
    def b_rearch(self, start, stop, target, array):
            if (start > stop ):
                return False
            mid = (stop + start ) // 2
            if (array[mid] == target):
                return True
            elif (array[mid] > target):
                return self.b_rearch(start , mid-1, target , array)
            else:
                return self.b_rearch(mid+1 , stop, target , array)
    def Find(self, target, array):
        lenght = len(array[0])-1
        high = len(array)-1
        while(high > 0):
            if(array[high][0] > target):
                high = high - 1
            else:
                break
        for i in range(0,high + 1):
            if(self.b_rearch(0, lenght, target, array[i]) == True):
                return True
        return False