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: [[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]

A: [79, 24, 65, 25, 84]
****
Q: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]

A: [-105, 97, 59, 80, -47, -51, 9, 70, 81]
****
Q: [[86, 7, 31, -172], [-115, -107, -45, -197], [-183, -25, -107, -48, -43], [-130, -138, 16, 83, -9]]

A:
[86, -45, -25, 83]
****