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.
[[-118, -191, -190, -32], [75, -182, -177, -117], [-12, 65, -162, 74, -31], [99, -83, -114, -42, -178, -110, -23], [-137, -99, 10, -144, 51], [-133, 1, -81, -49], [-10, -189, 16, -148], [50, -53, -110, -152, -38, -187]]