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]: [[-45, -1, -51], [-156, -12, -52, -85, -77, -21, -82], [-134, -82, -110, -168], [-118, -182, -74], [21, -44, 78]]
[A]: [-1, -12, -82, -74, 78]


[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]: [[50, -49, 28], [31, 26, 15, 17]]
[A]:
[50, 31]