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.
[[-165, -195, -88, -9, -109], [10, -115, -24, -82], [11, -141, 5, -88], [90, -5, -45, -6, 43, -162, -74], [44, -139, -137, -50, -152, -152, 81], [51, -200, -40, -95], [32, 1, 91]]