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: [[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]

Output: [-134, 11, 21, 86, -74, 18, 81, 92, 79]


Input: Consider Input: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]

Output: [-65, 43, 97]


Input: Consider Input: [[-132, -53, -141, 8], [-156, -77], [34, -25, -127, -81, -175, 30, 51]]


Output: [8, -77, 51]