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:
[[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

Ex Output:
[58, 54, 100, 65]


Ex Input:
[[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

Ex Output:
[22, -12, 60, 59, -8, 90]


Ex Input:
[[87, -129, 69, -74, -73], [26, 85, -197, -96], [-198, -124, -54], [33, -198, 27, 97, -163, 78], [-35, -44, 93, 50, 56, 37]]

Ex Output:

[87, 85, -54, 97, 93]