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: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

A: [-76, -61, 22, 62]
****
Q: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]

A: [25, 54, -45, 79, 96]
****
Q: [[50, -118, 67, -7, -86, -200, 19], [33, -31], [64, -70, 80, -53, -103, 15, -1], [-198, -93, -116, -17, 93, -45], [67, -87, -139, 71], [-112, 30, -5, 71, -89, 96], [-101, -133], [-16, -177, -8, 27], [64, 44, -84, -176, -85]]

A:
[67, 33, 80, 93, 71, 96, -101, 27, 64]
****