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.
[[-165, -49, -162], [47, -107, -58, 96, -87, -129, -158], [-58, -59, 6, 52], [23, -79, 78, 29], [-100, -141, -9, 18], [-183, -117, 50, -198, 88, -11], [26, 86, 23, -106, 60, 35]]