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]: [[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]
[EX A]: [77, -137, 76, 92, 89, 61, -126, 98, 62]

[EX Q]: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]
[EX A]: [56, -87, 97, 5, 75, 100, 39, 38]

[EX Q]: [[75, -16, 74, 100], [-47, 79, -99, 2, -137], [69, -148, 54, -183], [-58, 77, 32, -142, -83], [76, -138, -76, -192, -178], [-193, -41], [-123, 85, -54, -33, -180, -161, -160]]
[EX A]:
[100, 79, 69, 77, 76, -41, 85]