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.

Example Input: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]
Example Output: [21, 70, 64, 38, 64, -27]

Example Input: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]
Example Output: [98, -44, 98, 19, -1, 50, 98, -17, 48]

Example Input: [[-195, 70, -139], [60, -30, -37, -4, -26, -4, -142], [61, -127, 88], [-18, -23, 23, -155], [-95, -131, -151, -198, -98, -153, 74], [31, -12, -144, -4]]
Example Output:
[70, 60, 88, 23, 74, 31]