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.
[[-53, -28, -69, -128, -80, -131], [-29, -36, -22, 33, -61, 66, -175], [91, -193, -27, -189, -23, 65], [-150, -155, -35], [-40, 92, 47]]