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.
[[-160, 22, -169, -148, 50, -149, -97], [-75, 2], [23, 95, -122], [-145, -62, -116], [-59, 54, -49, -72, -124], [54, -159, 87, -6, -107, 80, -58], [54, -42, 77, -159, 95, -106, 17], [-91, -105, 1, -178, -175, 94, 41], [-48, -198, -191, -19, -77]]