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.
[[-105, -54, -122, -97, -139, 25, -92], [63, -63, 29, 3], [43, 22, 24, -151], [-45, -158, -85, 87], [-110, -61], [-25, -13, 8], [-1, 81, 1, 13, -118], [66, -127, 67, -48, -172, -14, -175], [47, -52, -199, 7, -53, -148, -141]]