In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

Ex Input:
[[92, -175], [-99, -116]]

Ex Output:
[92, -99]


Ex Input:
[[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]

Ex Output:
[96, 2, 19, 59, 43, 38, -46]


Ex Input:
[[-44, -3, -119], [72, -88, -9, -130, -58], [20, -196, -122, -105, -180, -128], [-126, -49, 51, -36]]

Ex Output:

[-3, 72, 20, 51]