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: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

A: [-6, -59, 52, 14, 96, 37, 62]
****
Q: [[53, -23, -128, 36], [-185, 98], [14, -141, 3, -44, -15, 80, -102], [-186, 65, -1, 65, -29, 64, 61], [63, -156], [-4, 83, -114, -88, -84, -140], [-182, -48, -125, -190, -12], [89, -41, -80, -64, -39]]

A:
[53, 98, 80, 65, 63, 83, -12, 89]
****