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: [[-181, -160, -10, -6, -128], [78, -145, -191, -36]]

A: [-6, 78]
****
Q: [[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

A: [38, 25, -7, 1, 40, 92, 87, 76, -95]
****
Q: [[-89, -105, 12, -187], [-45, 31, 29, -174], [-60, 38, 53, -165, -92, -143, 90], [-43, 34, -56], [-11, -106, -47, 38], [-67, -192], [-126, -136], [-1, -6], [-111, -104, -133]]

A:
[12, 31, 90, 34, 38, -67, -126, -1, -104]
****