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: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

A: [-6, 36, 29, -46, -41, 35]
****
Q: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]

A: [22, 9, -80, 65]
****
Q: [[75, -100, -196, -141, 57], [-59, 30, -19], [-172, -82, -147, -97, 90, -191], [39, -149, 77, 62, -82], [92, -70, -78, -112, -178], [93, 31, 97, 4]]

A:
[75, 30, 90, 77, 92, 97]
****