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:
[[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]

Ex Output:
[93, 7, 60]


Ex Input:
[[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]

Ex Output:
[-26, -126, 23, 95, 100, 13]


Ex Input:
[[-85, 67, -124, -193], [86, 66], [-159, -186, -174, 77, -191, -192, 72], [-123, 89, -138, -75, 7], [-117, -141], [-65, 23, 18, -177, -66], [20, -150, 40], [-31, 5, 58, -77, -2, 81]]

Ex Output:

[67, 86, 77, 89, -117, 23, 40, 81]