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.
[[90, 43, 66, -119], [9, -78, 22, 6], [78, -152, 9], [94, -167], [-41, -129, -74, 12, -178, -3], [-132, -166, 10, -131, -24, -136, -19], [-59, -51, -66, -33], [-129, -35, -44], [-146, 3, 2, -57]]