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.
[[-165, 9, -111, -190, 24, -162, -89], [-36, 51, -79, -122], [54, -8, 33, -56, -26], [47, -49], [-187, -99, -127, -8, -46], [72, -108, 82, -50, -87, -28], [-31, 31, -6, 68, 1, 90], [89, -175, -69, -116, 96], [-143, 35, -104, 0, -73]]