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: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]

A: [69, 65, -70, 55, 46, 38]
****
Q: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

A: [29, 63, 12, 34]
****
Q: [[-81, -97, 1, 40, 17], [-147, 85, -34, -122, -56], [-8, -2, -140, 16, -160], [58, 37, -41, -41], [-23, -14, -63, 68, 11]]

A:
[40, 85, 16, 58, 68]
****