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.
[[-67, -132], [-59, 75, -177, -175], [15, 12, -81, -96], [-141, 44, 60, 18, 11, 34, -36], [-78, -186, -12, -164, -11], [63, 20, -106, -198, -101]]