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.
[[-20, -71, 6, -138, -187, -81, -191], [-157, -134, -87, -121, -73, 46, -152], [-96, -45], [-63, -12, 26, -139, -8, -198], [-135, -30, -142, -10], [-101, 16, -196, -162, -58], [93, -36, -155], [-41, 21, 38, -57, -173, -104], [-16, 53, -160]]