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.
[[58, -29, -85, -193], [-98, -56, 53, 63, -14, -101, 26], [-192, 22, 66, -35, 73], [43, -165, 9, -130, -61, -185, 96], [-148, 82, -18, -63, -196, 12, 66]]