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.
[[10, 38, -46, -163, -64], [-112, 80, -57, 84], [-200, -148], [-51, -69, -137, -155, 78, -23, -121], [15, -43], [-116, 64], [-14, -126, 94, -64, 24, -186, -200]]