Smallest Range Covering K Lists

Given k sorted lists, find the smallest range [a, b] containing at least one number from each list. If tied, choose the smaller a.

1 <= k <= 3500