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: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]

Output: [-19, -112, 30, 59, 65, -7, -16, 86, 39]


Input: Consider Input: [[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]

Output: [92, -28, 98, 72, 23]


Input: Consider Input: [[-110, 68, 60, 75, -147], [-49, -37, 60, -159], [70, 95, -2, -194, 8]]


Output: [75, 60, 95]