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:
[[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]

Ex Output:
[76, -40, 87, 30, 27, 27, 51]


Ex Input:
[[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]

Ex Output:
[39, 6, 91, -7, 52, 99]


Ex Input:
[[75, 55, -27, 97, 51], [26, 22, -37, -196, 7, -61, 51]]

Ex Output:

[97, 51]