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.
[[-46, -88, -166, -44, -110, -68], [-98, 59, -199, 7, -10], [77, 82, -97, 44], [-111, 20, 82, -47, -84], [-108, -199, -159], [-167, -61, -130, -71], [-194, 51], [100, -120, 36, -19], [-149, -58, 57, 47, -29, -36, -71]]