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:
[[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]

Ex Output:
[55, 64, 56, -31, -4, 51]


Ex Input:
[[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]

Ex Output:
[-110, 37, 0, 24]


Ex Input:
[[-186, 89, -33], [-84, 59, 55, -19], [97, 75, -152], [100, 83, -71], [-197, -186, -151, -29, -57, 81], [-155, -85, -31, -28, -89, -142, 40]]

Ex Output:

[89, 59, 97, 100, 81, 40]