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: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

A: [82, -35, 37, 86, 1, 46, 99]
****
Q: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]

A: [16, 13, 97, 19, 36, 10, 60]
****
Q: [[-112, 25, -93], [28, -32, 33], [-145, -73, -143, 56, -167, -53], [-16, -63, -73, 7, 85, -109], [-28, -165, -7, 90], [0, -13, 6], [-21, 44, -15, -7], [-71, 68, -64, 31]]

A:
[25, 33, 56, 85, 90, 6, 44, 68]
****