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.
[[-129, -69], [30, -38, 4, -6, -19, -20, 66], [-26, -152], [-92, -53, 87], [16, -140], [28, 33, 49, 10, -198]]