boolean searchRow(int[] A, int s, int e, int target) {
		int mid = (s + e) / 2;
		if (mid - 1 < s) {
			if (A[s] == target)
				return true;
			else if (A[e] == target)
				return true;
			else
				return false;
		} else {
			if (A[mid] == target)
				return true;
			else if (A[mid] > target)
				return searchRow(A, s, mid - 1, target);
			else
				return searchRow(A, mid + 1, e, target);
		}
	}