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.
[[-128, 70, -62], [6, -141, -141], [-155, -36, 30, 43, -11, 34, -147], [-173, -11, -86], [-1, -63], [-149, -155, -163, -12, -21], [-189, -193, -90, 33], [-20, -41, 16, -197, -61, -157], [-55, 77, -9, -173, -80, -148, 81]]