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: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]

A: [36, -23, 76, 20]
****
Q: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]

A: [52, 39, 95, 2, -17, 57, 73, 70, 44]
****
Q: [[-26, -26, -68], [57, 37, -187, -168, -66], [51, -54, -26, -136, -145, 26, -41], [44, -10, 35, -22, -177, -28], [55, 27, 41, -142, -62, 95]]

A:
[-26, 57, 51, 44, 95]
****