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:
[[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]

Ex Output:
[12, -10, -48, -35]


Ex Input:
[[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]

Ex Output:
[9, 29, 22, 85, 77, 75]


Ex Input:
[[-166, -162, -75], [-40, -150], [-133, 54, 43, -98], [28, -8, 93, 37, -136], [-131, 19, 42, 36, -172, -166], [-72, 27, 94, -149]]

Ex Output:

[-75, -40, 54, 93, 42, 94]