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.
[[68, 71, -114], [-196, -180, -91, 88, -180, 42, -36], [-171, -166, -149], [21, 44, -122, -61], [-132, 73, 34, -52, 55, -11], [-198, -8, 67, 69, -67, -149], [39, 16, -48, -6, 43], [-124, -155, -129, -120]]