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.
[[32, 4, -29, -31, -60, -75, 93], [-160, -55, -47, -104, 64, -140, -113], [17, -112, -65, 16, -64], [99, 38, 4, -122, 41, -174], [-174, -168, -34, 48, -18], [-92, -177], [-129, -6], [8, -187, -141, 37, 92], [-163, -12, -186, -198, -159, -12]]