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: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]

A: [86, 46, -128, 81, 40, 67]
****
Q: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

A: [79, 56, -1, 85, 89, 61, -62, 31]
****
Q: [[-154, 13, -10, 54, 84], [16, 1, -106, -103, -109], [-15, 11, -6, -121], [88, -160], [-24, 82, 22]]

A:
[84, 16, 11, 88, 82]
****