def returnSegments(item, segments, leftList, rightList):
    for leftN in range(len(leftList)):
        if leftList[leftN][0] > item:
            break
for rightN in range(len(rightList)):
    if rightList[rightN][1] > item:
        break
return list(set(leftList[:leftN]) & set(rightList[rightN:]))

def testReturnSegments():
    for item in range(0, 100):
        item = item % 100
finding a set of ranges that a number fall in