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:
[[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]

Ex Output:
[-7, 71, 29, 59, 93, 71]


Ex Input:
[[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

Ex Output:
[33, 34, 68, -13]


Ex Input:
[[-162, -163, -115], [-131, 32], [-83, -113, -135, -57, -63, 58, 55], [17, 98, -180, -134], [50, -46, -11, -33, -117, -115, -102], [-120, 68, 62, -98, 12], [95, -19]]

Ex Output:

[-115, 32, 58, 98, 50, 68, 95]