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:
[[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

Ex Output:
[28, 70, 52, 63, -145, 11]


Ex Input:
[[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

Ex Output:
[-20, 93, 17, 91, 69, 44, -21, 98, 25]


Ex Input:
[[-175, -161, -85, 30, -60, -80, -111], [36, -89], [-189, 1, -167, -61], [75, -182, 68, 54, -59, 31, 21], [24, 22, -138, 0, -185, 53, -199], [3, 87, -98, 77, -40, -15, -179], [-85, -90, 13, 24, 66, -129], [79, -120, 34, -188]]

Ex Output:

[30, 36, 1, 75, 53, 87, 66, 79]