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:
[[-36, -152, -104, -52, 52, 6], [90, -19, -71, -183, -183, -15, -153]]

Ex Output:
[52, 90]


Ex Input:
[[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]

Ex Output:
[86, 76, -100, 99, 27, -48]


Ex Input:
[[40, 47, -2, -157, -8], [-190, -1, -20, -135], [20, 29, 96, 80, -131], [55, -158, -165, 51, -139, -143, -98], [-25, 90, -142, 78, -138, -130], [-138, -172, -91, -39, -28, -152], [-74, 25], [-22, -118, -122]]

Ex Output:

[47, -1, 96, 55, 90, -28, 25, -22]