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:
[[57, -140, -88, -200, -81, 0], [-17, -81], [-64, -151, -32, -36, 58, 27, -86], [-142, -121, -92, 0, 53, -73], [-21, 51, -25], [63, 88, 25, 10], [-95, -148, 25, -161, -168, -76], [2, -111, -15, -79, 61], [-44, 12, -135, -7, 73, -84, -144]]

Ex Output:
[57, -17, 58, 53, 51, 88, 25, 61, 73]


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:
[[23, -13, -171], [-157, 30], [84, -152, -11, 85, -150, -27, 67]]

Ex Output:

[23, 30, 85]