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]: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[EX A]: [71, 71, -38, 60, 7, 97, 76]

[EX Q]: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]
[EX A]: [1, 62, 100, 26, 85, 56, -9]

[EX Q]: [[-114, -196, -136, 17, 11, -127, -154], [56, -23, -104, -156, 77], [97, -5, 39, 78, -124, -197], [-49, -24, 76], [24, -103, -199, -151, -107, -46], [-197, -121, 50], [50, -81], [-34, -23, 25, 67, 26, -70]]
[EX A]:
[17, 77, 97, 76, 24, 50, 50, 67]