code: def insort_right(a, x, lo=0, hi=None, *, key=None):
      """Insert item x in list a, and keep it sorted assuming a is sorted.
  
      If x is already in a, insert it to the right of the rightmost x.
  
      Optional args lo (default 0) and hi (default len(a)) bound the
      slice of a to be searched.
      """
      if key is None:
          lo = bisect_right(a, x, lo, hi)
      else:
          lo = bisect_right(a, key(x), lo, hi, key=key)
      a.insert(lo, x)
  
label_desc: Use image node_id 1 for calling a global function with example usage: insort_right(a, x, lo, hi) without return types