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.
[[-48, 86, -190], [-148, -145, 55, -32, -31, -108, 75], [-143, -37, -145, -12, -149], [54, -31], [58, -131], [-98, 32, -181], [-117, 31, -32], [-157, -95], [-93, -53, 80, -21, 41, 66]]