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: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]

A: [56, -87, 97, 5, 75, 100, 39, 38]
****
Q: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]

A: [-19, -112, 30, 59, 65, -7, -16, 86, 39]
****
Q: [[-139, 19, -20, -118], [65, 59], [57, -144, 14, 46, -128, -69], [-29, -66], [-135, -163, -172, 37, -1, 84, 42], [46, 10, -133, -96]]

A:
[19, 65, 57, -29, 84, 46]
****