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.
[[-195, -160, -148, -160, -106], [81, -32, -72, -74, 44, -71, -26], [82, -115, -155], [61, -172, -114], [99, -26, 19, 42, -145], [-200, 83, 46], [-149, 21, -141, -119, -95], [-26, -83, -161]]