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:
[[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]

Ex Output:
[38, 66]


Ex Input:
[[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]

Ex Output:
[47, 27, 93, 67, 100, 70, 11, -5, -17]


Ex Input:
[[-101, -41, -96], [-71, -132, -51], [60, 73, 71, -76], [-198, -199, -50, -11, -91, 62], [79, -67, -109, -197, 13, 5, 2], [-139, -159]]

Ex Output:

[-41, -51, 73, 62, 79, -139]