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]: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]
[A]: [99, 1, 16, 19, 62]


[Q]: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
[A]: [79, 0, -71, 32, 98, 26, 20, 70]


[Q]: [[86, -121, -142, -58, 46, -11], [98, -142], [-143, -63], [-8, -50, -118, 37, -52, -27, 57], [-169, -160, -101, -147, -197, 55]]
[A]:
[86, 98, -63, 57, 55]