Find Right Interval LeetCode solution in Python

1
class Solution:
2
    def findRightInterval(self, intervals):
3
        ints = sorted([[j, k, i] for i, [j, k] in enumerate(intervals)])
4
        begs = [i for i, _, _ in ints]
5
        out = [-1] * len(begs)
6
        for i, j, k in ints:
7
            t = bisect.bisect_left(begs, j)
8
            if t < len(begs):
9
                out[k] = ints[t][2]
10

11
        return out