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:
[[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]

Ex Output:
[-26, 0, 75]


Ex Input:
[[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

Ex Output:
[60, -32, 68, 93, 24, 26, 7, 85]


Ex Input:
[[-195, -100, -1, -199, -41], [63, -70, -126, -145, 69, -108], [-73, -140, -133, 21, -57, 70]]

Ex Output:

[-1, 69, 70]