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.

[EX Q]: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]
[EX A]: [-66, -6, 91, 69, -24, 72]

[EX Q]: [[-65, -132, -105, 40, 32, 84], [-53, -33]]
[EX A]: [84, -33]

[EX Q]: [[91, -182, -196, -71, 35], [22, -163, -176, -29, -184], [-37, -109, 54, -148, -143, -160, 61], [51, -64], [-22, -155, 6, -181, -125, -112, 50], [45, 51, -61, 88, -32, -86, -22], [-126, -7, -186, -4, -173, -115, -79], [-101, -34, -138, -165, 69, -79, 67], [-67, 73]]
[EX A]:
[91, 22, 61, 51, 50, 88, -4, 69, 73]