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.
[[-31, -106, 76, -171, -165, -155, -65], [21, 29, 48, -139, -113, 8], [-176, -150, -27, -54, -72, -102, 29], [-65, -198, -113, -18, -198, 86, 98]]