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.
[[-118, -198, -191, -122, 38, -32], [-46, 90, -146, -176, -163, -128, -163], [34, -162, 65], [-21, -155, -149, -112], [-186, -17, 45, 80, -68, 36]]