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:
[[14, -199], [-96, -75, -1, -54, -147, 98, 70], [2, 49, -99, -98, 48], [45, -143, -123, 36, 77, -115, -27], [-102, -120, -166], [69, -52, -1, -104], [-72, -135], [-77, 69, -114], [-47, -151, -82, -73, 92, -19]]

Ex Output:
[14, 98, 49, 77, -102, 69, -72, 69, 92]


Ex Input:
[[-117, -191, 74, -91, 71], [-175, -177], [67, 65, -160], [-98, -28, -119, -66, 29, 7, -106], [-7, -132, -151], [-139, -163, -10, 40, 81]]

Ex Output:
[74, -175, 67, 29, -7, 81]


Ex Input:
[[84, 10, -135, 5, -101, -54], [-62, -87, -145, -139, -130, -49], [-4, -179, 26], [39, -55, -152], [-7, -163, -7]]

Ex Output:

[84, -49, 26, 39, -7]