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: [[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]

A: [16, 51, 99, 35]
****
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: [[11, -79, -80, 73, -190, -68, -157], [-73, -156, -57, 80], [2, -72, -28, 35, 35], [-153, -47, -101], [64, -110, -172, -44, -35, 13], [-106, -66, 19, -73]]

A:
[73, 80, 35, -47, 64, 19]
****