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: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
Example Output: [98, -11, 98, 26, 10]

Example Input: [[78, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]
Example Output: [78, 97, 65, 100, -39, 22]

Example Input: [[-82, 52], [-132, 42, 81, 43, -176, 91, 95], [-27, 91, -188, 1]]
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
[52, 95, 91]

