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.
[[61, -18, -49, -28, 27, -187, -126], [41, -175, -34, -78, -121, -46], [-87, -161, -62], [-95, -148], [-182, 37, 49, -39, -101, -52], [94, -2, -141, -143, -49], [-162, -133, 65], [88, -30, -78, -58, -59, -5, 95], [-139, -85, -80, -198, -55]]