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: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Output: [45, 33, 26, 69, 89, 95, 57, -4]


Input: Consider Input: [[-122, -18], [-126, -168, -62], [-185, 20, -166, 59, -185, -181, -174], [-32, -105, 14, -182], [91, 95], [-12, -124, 4, -192, -101, -200, -69], [-49, -113, 94, 50], [23, -25], [92, -139, -21, -136]]

Output: [-18, -62, 59, 14, 95, 4, 94, 23, 92]


Input: Consider Input: [[-84, 29, -123, -90, -135, -182], [-175, -41, -73, -194, -2, -41], [-172, -160]]


Output: [29, -2, -160]