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.
[[-58, -109, -171, -175, -143, -20], [-193, 49, 80, -146, -138], [4, 25, 16, -141, 62, -164], [-185, -87, -124, -197, -140, -141, -138], [-59, -14], [-188, 54, -56, 47, 79, -186, -188], [-60, 31, -141], [-197, -44, 71, -21], [-10, 84, -120, -56, 27, -52, -128]]