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.
[[-186, -181, -19, 52, 8, -72, -67], [67, -22, -115, -99, -83, -148, -77], [31, 68, -91, -113], [-146, -92, -62, -32, 61, -106, 32], [73, -137, 53], [73, -104, 36, -76, 72, -164], [-188, -65, 35], [27, 30], [84, -176, -53]]