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.
[[38, 0, -6, 94, -117, -85], [-29, -183, -136], [45, -175], [-185, -98, -117, -190, 64, -172, -58], [-142, -114, 10, -37, 36, -174, 66], [-195, -185, 33], [-23, -176, -108], [53, 56, 21], [12, -161, -24, 15]]