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.
[[-103, -181, 59, 89, -180], [-53, 26, -18, -98, -194, -2], [-156, 76, -120, 46], [-78, -32, 87], [30, 14], [-18, 15, -97, 36, -149, 75], [-175, -125, -187], [86, 62, -163, -20, -56, 59, -43], [-48, -21, -4, -189, -172]]