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: [[52, -72], [-90, -59, -53, -180], [13, -64, -153], [-149, -38, 7, 61, 93, 1]]

A: [52, -53, 13, 93]
****
Q: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

A: [95, 60, 31, -122, 66, 84, 17]
****
Q: [[-45, -119, 92, 65, -197], [40, -194, -52, -133, -132], [-95, -136, 79, -140, -70], [83, 26, -191], [-168, -168], [-5, 55, 13, -90, 17, 93, 57], [-135, -77], [44, -104, 27], [51, -60, -25, -112, -117, 39, -151]]

A:
[92, 40, 79, 83, -168, 93, -77, 44, 51]
****