recursively find the second (kth generally) largest int in list of list of int python : As a newbie in programming, i am trying to do a func to find the second largest int in a list of list of ints. I tried list of ints before and it worked.  

However, for this function, its base case has too many possibilities, ex [1, 2], [[], 1], [[1], 2], [[1], [1]]. I got stuck at the base case. Can anyone give me a hint for this? 

This func would be like find_2smallest([1,1,3])->1, find_2smallest([[1,[]], 9, [[1], [3]], [4]])->3.