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.
[[35, -140, -143, 12, -150, 6, -36], [-169, -45], [66, -200], [-13, -134, -31]]