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.
[[32, 83, -139, 60, -46], [-177, -140], [12, 2, 95, -51, -21, -113], [-25, -68], [-86, -161, 13, 70, -65, 77, 74], [1, -194, -200, -144, -163, 15]]