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.
[[21, 63, -112, -123, -19, 63, 41], [19, -63, 56, -186, -85, -129, -16], [-197, 48, 50, -199, -70, 46]]