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.
[[-81, -187, 26, 10], [-116, -17, -66, -174, -26], [-161, -64], [46, 14, 78, 81, -143, -4], [57, -91, -177, -13, 59, -140, -170], [-19, -112, -127], [1, -113, -110, -54, -165], [-27, -59, 11], [-9, -55]]