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: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

A: [90, -4, 18]
****
Q: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

A: [73, 26, 81, 48, 31, 25, 44, 31]
****
Q: [[-72, 100, 91, -153, -144, -157, 68], [32, 66, -168], [-179, -187, 43], [71, -105, -114, 52, 22, -167], [-124, 4, -42, 48, -123, -132, -32], [48, -132, -59, -114, -147, -36], [30, 26, -19, 62, -49], [-191, 66], [32, 100, -50, -188, 23, 91]]

A:
[100, 66, 43, 71, 48, 48, 62, 66, 100]
****