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.
[[25, 21, -76, -56, -109], [-29, -44, 79, -176, 72], [-65, 85, -192, -64], [-33, 64, -108, 48, 7, -90, 82], [88, 98, -61, -79], [-102, -122, -110, -156, -101, 6, -31]]