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:
[[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]

Ex Output:
[22, 9, -80, 65]


Ex Input:
[[-132, 87, 9, -146, -184], [97, -169, -21, 52, 16, -182, -6], [-60, -2, -147, 55], [-111, -154, -41, 37, -97, -139, -111], [33, -113, -106, -92], [-13, 49, 66, -121, 61, -129, -124], [72, -107, -192, 86]]

Ex Output:
[87, 97, 55, 37, 33, 66, 86]


Ex Input:
[[-121, 13], [93, 44, 82, -186, 18, -168], [16, -149, -95, -115, -31], [31, -9, -197, 25, 25], [49, -33, -11]]

Ex Output:

[13, 93, 16, 31, 49]