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:
[[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

Ex Output:
[33, 34, 68, -13]


Ex Input:
[[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]

Ex Output:
[-59, 78, 25, 94, 91]


Ex Input:
[[24, -11], [88, -150], [31, -71, -162, 75, -157, -22, -16], [55, -64, -155, -88, 34, 25]]

Ex Output:

[24, 88, 75, 55]