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:
[[-49, -181, -26, -69], [-2, 61, -87, 2, -166, -161]]

Ex Output:
[-26, 61]


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:
[[-78, -98, 28, -65, -73, -80], [-106, -48, 45, -160, 1, -136, -175], [-180, -74, -17]]

Ex Output:

[28, 45, -17]