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.
[[-142, -195], [91, -29, 29, -27, -165, 13], [-142, 6], [-156, -118, -3, -70], [56, 29, -122, -67], [-56, -110, -140, -2, 96, -31], [-21, -13]]