4 def insort_right(a, x, lo=0, hi=None, *, key=None):  argument
15         lo = bisect_right(a, x, lo, hi)
17         lo = bisect_right(a, key(x), lo, hi, key=key)
18     a.insert(lo, x)
21 def bisect_right(a, x, lo=0, hi=None, *, key=None):  argument
34     if lo < 0:
41         while lo < hi:
42             mid = (lo + hi) // 2
46                 lo = mid + 1
48         while lo < hi:
49             mid = (lo + hi) // 2
53                 lo = mid + 1
54     return lo
57 def insort_left(a, x, lo=0, hi=None, *, key=None):  argument
69         lo = bisect_left(a, x, lo, hi)
71         lo = bisect_left(a, key(x), lo, hi, key=key)
72     a.insert(lo, x)
74 def bisect_left(a, x, lo=0, hi=None, *, key=None):  argument
87     if lo < 0:
94         while lo < hi:
95             mid = (lo + hi) // 2
97                 lo = mid + 1
101         while lo < hi:
102             mid = (lo + hi) // 2
104                 lo = mid + 1
107     return lo