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.
Q: [[-121, 18, -98, -165], [64, -90, -196, -179, 73, -117], [-158, -96, -26, -149, -41], [-191, -51, -5, -157, 11, -185]]
A: 
[18, 73, -26, 11]