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.
[[-84, 9, 91, -137, -159, -113], [-114, -105, -84], [-41, -124, 72, -120, -71, -154, -182], [86, -198, -59, -33], [-166, -115, 96, -10, -175, -20, -42], [-63, -41, 78, 16, 9, -118], [-52, -182, -63, -11, -199, -117], [-70, -154, 1, -197]]