code: def bisect_key_right(self, key):
          
          _maxes = self._maxes
  
          if not _maxes:
              return 0
  
          pos = bisect_right(_maxes, key)
  
          if pos == len(_maxes):
              return self._len
  
          idx = bisect_right(self._keys[pos], key)
  
          return self._loc(pos, idx)
docs: Same as *bisect_key_left*, but if *key* is already present, the insertion
          point will be after (to the right of) any existing entries.