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: [[-129, -155], [-197, -113, -8, -126, -172], [85, -141, -164, -98, 36]]

A: [-129, -8, 85]
****
Q: [[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]

A: [85, 21, 34, 90, 81, 32, 77, 65, 97]
****
Q: [[-103, -181, 59, 89, -180], [-53, 26, -18, -98, -194, -2], [-156, 76, -120, 46], [-78, -32, 87], [30, 14], [-18, 15, -97, 36, -149, 75], [-175, -125, -187], [86, 62, -163, -20, -56, 59, -43], [-48, -21, -4, -189, -172]]

A:
[89, 26, 76, 87, 30, 75, -125, 86, -4]
****