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.

Input: Consider 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]]

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


Input: Consider Input: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]

Output: [24, 93, 61, 79]


Input: Consider Input: [[50, -28, -82, -77], [-164, 17, -27, -143, 47, 61], [21, 24, -171, -56, 0, -197], [28, 79, -45, 20], [-191, 59, -64]]


Output: [50, 61, 24, 79, 59]