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.
[[42, 7, -159, -152, -60, 97, 22], [-43, -193], [-57, -155], [77, 96], [-169, 32, -151, -66, 68, -76, -190], [-123, 87, 50], [-41, -7, -39], [-123, -111, -123], [32, -95, -6, 36, -106]]