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:
[[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

Ex Output:
[58, 19, 68]


Ex Input:
[[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]

Ex Output:
[55, 51, 83, 61, -9, 67, 15]


Ex Input:
[[-140, -168, 17], [-115, 98], [-128, 10, -12], [-177, -99, 70, -69, 27], [-160, 63, -33, -122]]

Ex Output:

[17, 98, 10, 70, 63]