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:
[[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

Ex Output:
[12, -16, 41, 50]


Ex Input:
[[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

Ex Output:
[65, 53, 72, -30, 85, 38]


Ex Input:
[[88, -97], [-155, 90, 79, -45, -74], [-98, -154, -56, -15, -63, -2, 82], [-71, -117, 57, -144, -150], [-34, -109, -7, -121, 68, 39, -69], [-200, -116, -54], [-200, -117, -150, -172, 38], [-91, -175, -50, -184, -143]]

Ex Output:

[88, 90, 82, 57, 68, -54, 38, -50]