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]: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]
[EX A]: [67, 85, 90, 76, 81, 98, 94]

[EX Q]: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]
[EX A]: [9, 29, 22, 85, 77, 75]

[EX Q]: [[-31, -14, 22], [91, -31, -99, 78], [63, 12, -106, -184, 34, 41], [5, -63, -106, -63, 58, -33], [-9, -196, 32, -84, -16, -171, 23], [1, -194, -64, -126, -33, -120, 49], [-154, -9, 3, -56, 78, 5, -62]]
[EX A]:
[22, 91, 63, 58, 32, 49, 78]