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.
[[-46, -14, -178, -148, -26, -89, -24], [-104, -14, 85, -22, -177, -102, -151], [64, 16, -138, 53], [-120, 12, -106, -163, -200, 15], [-23, 12, -158], [-48, -93, -165, -110, -8, 29], [-75, -76, 24, -178, -143, -59, -88], [76, -194, -168, -177, -29, 7, 46], [-70, -21, 67, -197]]