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.
[[-185, 36, -50, 9, -6], [32, -25, -161, -138, -66], [-141, -128, -187, 33, -187], [-51, 74, -108, 9, -29], [-36, -184, 42, -113], [40, -195]]