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.
[[91, 11, 5, -95, -4], [25, -16, -52], [57, -55, -188, -156, -152, -189, -96], [34, 38], [-56, 38], [44, -23, 34, 66, 49, -1], [10, -119, -102, -85, -75], [-195, -148, 65], [-164, 84, -9, -106]]