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.
[[-111, -164, -34, 78, -61, 74], [27, -18, -143, 30], [-164, 61, 79], [-179, -78, -53, 68, 16, -1, -104], [29, 68], [-138, 89, -112, -157, -32, -153, -90], [-75, -22, -190, -194], [-64, 13, 10, 10, -186], [-179, -64, -102, -134, -176]]