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: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]

A: [97, -5, 47, -13, 95]
****
Q: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

A: [84, 1, 35, -78, 24, 87]
****
Q: [[-4, -143, -13, -43, 26, 6, -138], [97, -61], [-185, -143, 45], [-79, 74, -130, 53], [-29, 3, -80, -30, 44, -138, 64], [-41, 25, -134, 30, 8, -116, 76], [-178, -38, 74, -82, 51], [-90, 93, -109, -158, -31, -94]]

A:
[26, 97, 45, 74, 64, 76, 74, 93]
****