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.
[[32, 43, -104, 89, -47], [-111, 16], [-39, -134, -137, -100, 71], [4, -145, 15, -69], [-49, 23, 85, -124], [-127, -71, 83, 94, -34, -20], [-198, -46, -101]]