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.
[[-145, 43, -93, 26, 86, 46], [-31, -65], [92, -194, -178, -124, 90, -104], [-154, 16, 36], [-198, 32, -131, 56, -144], [84, -169, -33, -66, -200, -20], [-77, 98, -117, -156, -200, -9, -185], [-43, 51]]