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: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

A: [90, 98, 22, 85, 64, 77, 63, -152]
****
Q: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

A: [-53, -98, 36]
****
Q: [[-133, -184, -12, -115, -68], [-148, -112, -70, 13, -128, -119, -84], [-193, -136, -170, 69, -177], [2, 8, 99, -61, -184, -75], [-168, -117, -180], [-3, 36, -188], [57, -70, -171, -87, -183], [54, -23, -187, 37, 86, 20]]

A:
[-12, 13, 69, 99, -117, 36, 57, 86]
****