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.
[[-199, -196, -76, -47, -162, 84, -28], [-144, -112, -181, 3, -87], [-108, -123, 98], [-72, -113, -151], [-135, 14, -168, -122, 100, -101, 56], [-197, 32, -131], [-200, -169]]