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: [[64, -108], [42, 76, -28, -11, 28], [-37, -188, -155, 73, -137, 29], [-159, 66, 72, 95, -81], [-176, 24], [89, -106, 36, -126, -155], [-194, 39, -96, -11]]

A: [64, 76, 73, 95, 24, 89, 39]
****
Q: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

A: [55, 21, 75, 84]
****
Q: [[62, -152, 9, 20, -161, -82, -145], [-42, 76, 69, 8, -90, -183, 70], [-79, -145, -28, 11, -191], [3, -106, -90, 94, -134, -144, -59], [-152, -24, 26, 38, -61, 14, -47]]

A:
[62, 76, 11, 94, 38]
****