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:
[[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]

Ex Output:
[64, 55, 92, 95, 72, -29, 63]


Ex Input:
[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]

Ex Output:
[47, 58, 99, -57, 92, -77, 30, 0, -38]


Ex Input:
[[98, 45, 32, -7, 58, -61], [-136, 90, -71, -123], [38, -9, -166, -87], [54, -27, 25, -180, -26]]

Ex Output:

[98, 90, 38, 54]