Python调库

import sys
import bisect
input = sys.stdin.readline

n, q = map(int, input().split())
d = list(map(int, input().split()))
for _ in range(q):
    num = int(input())
    if num < d[0] or num > d[-1]:
        print(-1, -1)
        continue 
    left = bisect.bisect_left(d, num)
    if d[left] != num:
        print(-1,-1)
        continue
    right = min(bisect.bisect_right(d, num), n-1)
    if d[right] != num:
        right-=1
    print(left,right)