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.
[[51, 47, -114, -73, -56, -31], [-83, -6, -106, -167, -62, -150], [-116, 49, -75, -188, -21, 53, -198]]