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:
[[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

Ex Output:
[51, 49, 86, 66, 74, -151, 49, 25]


Ex Input:
[[-154, -145, 28, -154, -52, -41], [-198, 0]]

Ex Output:
[28, 0]


Ex Input:
[[68, 71, -114], [-196, -180, -91, 88, -180, 42, -36], [-171, -166, -149], [21, 44, -122, -61], [-132, 73, 34, -52, 55, -11], [-198, -8, 67, 69, -67, -149], [39, 16, -48, -6, 43], [-124, -155, -129, -120]]

Ex Output:

[71, 88, -149, 44, 73, 69, 43, -120]