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:
[[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]

Ex Output:
[99, 1, 16, 19, 62]


Ex Input:
[[-187, -179, -53, 29, -130], [45, -50, -46, -23, 82], [12, -82, 28, -108, 24, -77, -51], [2, -181, 87, -1]]

Ex Output:
[29, 82, 28, 87]


Ex Input:
[[-166, -60, 46, -169, 31], [-66, -126, -35, -128], [48, -162, -153, 34], [-100, -118], [82, -167, -68], [70, -160], [43, 64, 86, -182], [10, -109, 28], [-25, -113]]

Ex Output:

[46, -35, 48, -100, 82, 70, 86, 28, -25]