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: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]

A: [79, 95, 82, 66, -11]
****
Q: [[-168, -52], [-183, 2, -104, 24, -153, -56], [25, 78, -118, -28, -39, -12], [97, 95, 12, -21, 82]]

A: [-52, 24, 78, 97]
****
Q: [[88, -158, -30, 2], [-6, 3, -116, 87, 87, 30, 39], [-182, 95, -133, -200, 29, 81], [-173, -112, -52, -113, -48], [48, -164], [30, -113], [58, -18, 53, -126, -124]]

A:
[88, 87, 95, -48, 48, 30, 58]
****