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.
[[-11, 69, -172, -48, 46, -51], [-200, -172], [12, -140, -155, -122, -190, -92], [-31, 56, -161], [-186, -67, -66, 0, 66, -168, 16], [-7, -21, -67, -44, -159, -148, 63], [-107, 95, -16, -180, 10, -157], [-139, -7, -154, -196, 81, -193], [-40, -83, -46, -180, -54, 56, -128]]