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.
[[16, 48, -159, 40, 30, 100, -107], [-81, 75, -66, 98, -128, -9, 23], [-22, -60, -108, -95, -163], [-77, -87, -172], [-141, 68]]