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.
[[93, -22, -9, 97, 4], [40, -10, 93, -28, -40], [50, 16, -128, -110, 48], [-42, -90, -138, 9, -1, 68], [-27, -91, 28], [-47, -166], [-56, 85, -32, -54, -132, 36], [75, 69, 46, -139, 96, -133], [-19, -162, 83, 43, -150, -123]]