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:
[[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

Ex Output:
[55, 21, 75, 84]


Ex Input:
[[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

Ex Output:
[40, 84, 55]


Ex Input:
[[-108, 43, -114, -189, -142], [-186, 44, -158, -46, 34], [-41, -45], [-92, -137, -1], [31, -92, -14], [-152, 59], [57, 10]]

Ex Output:

[43, 44, -41, -1, 31, 59, 57]