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.
[[-115, -149, 39, -131, 8, -200, -47], [-144, 32, -110, -135, 4, -190], [-71, -169, -116, -51, -120, -2, 61], [57, -178, 83, -137, -139, -63], [12, -100, -24, -159], [70, -195, -44], [55, 13, -71, 21], [0, 54, -26, -120]]