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.
[[41, -41], [-75, -99, -35, 94], [-146, -69, -190, -55, -126, -23, -65], [-24, 49, -21, -128, -111], [-163, -146, -100, 71, -121], [-149, 66, 13, 69, -149], [-115, -145, -44, 97], [-20, -164, 30, -22], [14, -170, -119]]