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:
[[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

Ex Output:
[100, 97, 77, 11, 52, 74, 99, -25, 8]


Ex Input:
[[94, -71, -83, -154, -126, -62, -104], [-168, 66, 9, -12]]

Ex Output:
[94, 66]


Ex Input:
[[62, 85, 18, 50, -38, 14], [31, -185, -120, -36, -140, -114, 7], [-26, -1, 17, -21, -18, -181, 52], [-125, 30, -125, 23, 71, -186, -29], [9, -52], [-82, 69], [45, -101, 24, -2, 23, 16, 93], [-162, -49, 73, 8, 97], [-64, 7, -156, -9]]

Ex Output:

[85, 31, 52, 71, 9, 69, 93, 97, 7]