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.
[[-108, 36, -136, -84, 30, 7], [-100, -31], [76, -104, -131], [-73, -138, 95, -23, -175, 55, 36], [13, -9, -86, -61], [-23, -75], [4, 99, -137, -194], [-151, -18, -29]]