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:
[[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

Ex Output:
[-93, 50, 32]


Ex Input:
[[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]

Ex Output:
[-68, 43, 91, 96, 85, 80]


Ex Input:
[[-126, -25, -114, -88, -11, -31, -116], [-25, 71], [51, -200, 83, 54, -36], [28, 43, -38], [-1, -61, -85, 2, 43], [-197, -46, -187, 43, 75]]

Ex Output:

[-11, 71, 83, 43, 43, 75]