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.
[[-118, -195, 73, 55, -149], [-113, 12, -48, -35, 85], [-17, 81, 89, -78, -105, -40], [67, -188], [-125, -69], [45, 75, -35, -187, 79, 19, 90], [46, -20, -22, -191, 51, 63]]