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]: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]
[EX A]: [-26, 31, -27, 94, 69, 47, 55, -8]

[EX Q]: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]
[EX A]: [60, -36, 94, 68, 36, -64, 41]

[EX Q]: [[7, 24, -76, -36, -58], [-17, -158, -179, 17, -6, -147, -188], [-46, -32, -4, 27, -19, -13, -7], [-173, -126, 92, 67, 4], [-172, -196]]
[EX A]:
[24, 17, 27, 92, -172]