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:
[[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]

Ex Output:
[45, 86, 75]


Ex Input:
[[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]

Ex Output:
[84, 58, 37, 81, 58, 31, -135]


Ex Input:
[[41, -196, 72, -9, 87, 60, -135], [-8, -48, -107, -168, -112, -159, 35], [-115, 66, -199, -170, 50, 72], [-181, -134, -188, -9, 48, -136, -64], [27, -165, -130], [-44, -119, -56, -31, 22, -115], [99, -135, 62], [-92, 21]]

Ex Output:

[87, 35, 72, 48, 27, 22, 99, 21]