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.
[[-183, -4, -104, -79, -26, -200], [-80, 13, -131, 15, -122, -181, -132], [-40, -102, -178, -86, -172], [98, -135, -71, -3], [-96, -32, -20, -151, -96, 7], [-9, -194], [-121, -168, 72, 14, -88, 98], [-135, -173, -110]]