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:
[[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]

Ex Output:
[38, 80, 94, 31]


Ex Input:
[[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

Ex Output:
[33, 34, 68, -13]


Ex Input:
[[11, -14, -165, 18, -26], [-33, -95, -34], [99, -49, -53, -125, -65, -87], [-164, -196, 19, 46], [54, 4], [-71, -155, 33, 74, -65, -167, -175], [71, -56, 97, -112], [-95, -10], [-190, -44, -151, -41, -83, 4, 72]]

Ex Output:

[18, -33, 99, 46, 54, 74, 97, -10, 72]