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]: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]
[A]: [65, 75, 69, 44, 52, 16]


[Q]: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]
[A]: [45, 33, 26, 69, 89, 95, 57, -4]


[Q]: [[-76, -53, -62], [16, -152, -114, 16, 53, -199], [-191, 10], [15, 59, -34, 70, -107, 13], [-97, 99, 43], [-68, -81], [47, -62, -78, -82, 19, 58, 40], [-119, 53, -182]]
[A]:
[-53, 53, 10, 70, 99, -68, 58, 53]