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, 71, -103, -69, -95], [-139, -151, 75, 98, -197], [-6, -136], [-77, -160, -158, -182], [-193, -24, -49]]