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: [[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]

A: [-20, -7, 84, 98]
****
Q: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

A: [71, 44, 78, 87, 68, 91]
****
Q: [[-148, 18, -27, 39, 61, -124], [21, -52, -3, -151, -37, -186, -67], [-107, -127, -88, 81, -37], [-36, 36, 92, -165, -73]]

A:
[61, 21, 81, 92]
****