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:
[[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

Ex Output:
[82, -35, 37, 86, 1, 46, 99]


Ex Input:
[[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

Ex Output:
[67, 26, 7, -16, 78, 79, 4, 85, 35]


Ex Input:
[[14, -82, -42, -93, -21, -177, 51], [-138, -64, -74, 9, 80, -47, -90], [-173, -165, -102, -41]]

Ex Output:

[51, 80, -41]