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: [[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]

A: [77, 98, 57, 95, 68]
****
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: [[13, -68, -197, 25], [-81, 46, 59], [-41, -49, -110, -10, -44], [37, 54, -71, -133, 5], [54, 99, -174, -103], [-52, -103], [-73, -181, 58, -80, -141, -1], [-39, -145, -96, 47], [-33, -83, -92, 76, -30, -130, -66]]

A:
[25, 59, -10, 54, 99, -52, 58, 47, 76]
****