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.
[[13, -188, 91, -25, -102, -29, -186], [38, 85, -4], [-102, 67, -169, 19, 96, 11], [-117, 57, -197, -163, -120], [42, 16, -112], [-53, 25, 61, -46, -4], [8, 14, -47, -68, 70], [-106, -173, -113, -177, -185, -192]]