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:
[[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

Ex Output:
[91, 100, 86, 84, 13, 53, -32, 54]


Ex Input:
[[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]

Ex Output:
[97, 24, -43, 79, 51, 72]


Ex Input:
[[29, -7, -98, 98, 56, 17, -74], [12, -52, 40, -25, -137, 34], [-18, 74, 30, -29, -51, -37, -113], [94, 45, -36, -125, -149, 8, -155], [-136, -154, -197, -47, -69], [-81, -168, 99], [-146, 11, -133, -111], [-65, -107, -164, -98, 67], [-81, -146, 30, 58, 1, -176, -57]]

Ex Output:

[98, 40, 74, 94, -47, 99, 11, 67, 58]