def insort_right(a, x, lo=0, hi=None):
 if (lo < 0):
  raise ValueError('lo must be non-negative')
 if (hi is None):
  hi = len(a)
 while (lo < hi):
  mid = ((lo + hi) // 2)
  if (x < a[mid]):
   hi = mid
  else:
   lo = (mid + 1)
 a.insert(lo, x)

def insort_right ( a , x , lo = 0 , hi = None ) : if ( lo < 0 ) : raise ValueError ( 'lo must be non-negative' ) if ( hi is None ) : hi = len ( a ) while ( lo < hi ) : mid = ( ( lo + hi ) // 2 ) if ( x < a [ mid ] ) : hi = mid else : lo = ( mid + 1 ) a . insert ( lo , x )
insert item x in list a .