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: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]

A: [22, 9, -80, 65]
****
Q: [[-59, -114], [-11, -174, -23, -21, -51, 45, -92], [-29, 99, 77, -145, 52], [70, -181, -128, 75], [-121, 96, -40, -145], [-45, -74, 12, -105], [-35, 35]]

A:
[-59, 45, 99, 75, 96, 12, 35]
****