3 def insort_right(a, x, lo=0, hi=None):  argument
14     if hi is None:
15         hi = len(a)
16     while lo < hi:
17         mid = (lo+hi)//2
18         if x < a[mid]: hi = mid
24 def bisect_right(a, x, lo=0, hi=None):  argument
37     if hi is None:
38         hi = len(a)
39     while lo < hi:
40         mid = (lo+hi)//2
41         if x < a[mid]: hi = mid
47 def insort_left(a, x, lo=0, hi=None):  argument
58     if hi is None:
59         hi = len(a)
60     while lo < hi:
61         mid = (lo+hi)//2
63         else: hi = mid
67 def bisect_left(a, x, lo=0, hi=None):  argument
80     if hi is None:
81         hi = len(a)
82     while lo < hi:
83         mid = (lo+hi)//2
85         else: hi = mid