Smallest Range Covering Elements from K Lists - DSA Problem | Talentd