Similar to insort_left(), but inserting x in a after any existing entries of x.
bisect.insort_right(a, x, lo=0, hi=len(a), *, key=None)