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.

Example Input: [[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
Example Output: [55, 51, 83, 61, -9, 67, 15]

Example Input: [[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]
Example Output: [-15, 69]

Example Input: [[-3, -96, -48, -113], [92, -172, -51, -98], [-147, -12, 37, 49, 96, 74, -128], [-108, -31, 79, 64, -94, -151], [-10, 48, -25, 9], [90, -129, -111, -97, 83, -15, -72]]
Example Output:

Show your work and conclude with the exact phrasing "Therefore, the final answer is [answer]." where [answer] is just the final number or expression that solves the problem.
user
[-3, 92, 96, 79, 48, 90]

