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.
[[-74, 16, 11, -16], [-101, -193, 46], [-144, -88, -21, 82, 75, 2], [-187, 23, -3, -65, 1], [-200, -198, -129, -52, 98, 96], [-135, -14, 58, -145, -192, -182], [16, 10, -131, -71, 83, -7, -31], [-146, 96, -149, -104, -2, -30]]