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.
[[-72, 31, -196], [88, -7, -119], [-6, -71, 44, -36, 16], [-158, -57], [-85, 51, -110, -140, -10], [81, -27, 86, -50], [81, -50, -17, -39, 58, -121, 6]]