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: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]
Example Output: [19, -96, 60, 50, 63, 58, 92, 67]

Example Input: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]
Example Output: [79, 83, 25, 75, 98, 92, 84, 92, 28]

Example Input: [[-182, 41], [-96, 86], [-82, -195], [-51, 97], [-16, -53], [28, -162, -71], [-43, 40, -140, -185], [21, -26]]
Example Output:
[41, 86, -82, 97, -16, 28, 40, 21]