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.
[[-45, 95, -110, -104, 49], [-47, -23, -119, 90, -195, -161], [-11, -68, -168], [90, -9, -56, -71, -9], [-140, -152, 41, -116, -6, -118], [23, 7], [-52, -20, 77, -75, -150, -74]]