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:
[[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]

Ex Output:
[34, -30, 37, 55, 85, 61]


Ex Input:
[[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]

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


Ex Input:
[[25, -166, -161], [-15, 78, -116, -58, -32, -121], [-22, -99], [6, -59, 38, -109, -15, 97], [-125, 81, 86, 18, -173], [-113, 41, -108, 14, -117]]

Ex Output:

[25, 78, -22, 97, 86, 41]