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: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]

Output: [91, -49, 89, 83, 92, -91]


Input: Consider Input: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]

Output: [55, 64, 56, -31, -4, 51]


Input: Consider Input: [[-156, 59, -75, -69], [-34, -143], [91, 81], [-115, -71], [-3, -70], [-198, 71, 51, 30], [68, -75, 36, -150, -19, -110, -141], [-114, -175, -78, -59]]


Output: [59, -34, 91, -71, -3, 71, 68, -59]