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.
[[-103, -53, -88], [-6, 55, 71, -11, -156, 75, -32], [-51, -21, -112, -58, -121, -128, -39], [-62, -140, 32, -180, -52, -175], [-61, -56, -41], [-6, -196, 4, 71, -176]]