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.
[[38, -129, -65, -200, -19], [-44, -36, -91, -78], [-39, -9, -93, -118], [12, -38, 36, 0, -47, -96, 82], [58, -152, -121, -1, 96, 54], [-192, 9, -116, -98, 25, -142, -114], [-25, -31, -1]]