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.
[[-189, -108, -140, -62, 93, -40], [-181, -182, -94], [59, -99, -108, 70, 19], [-52, 45, 10, 75], [-6, -148, 79], [37, -28, -97, -186, 76, 23], [-96, 99, 24, -194], [-131, 40, 28, -164, -25, -53], [-46, -116, -189]]