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]: [[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[EX A]: [46, 34, 80, 76, 68]

[EX Q]: [[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]
[EX A]: [14, -43, -3, 14, 56, 61, -19, 97, -14]

[EX Q]: [[71, 78, 100, -60, 77], [-149, -170, -63], [-151, -10, -40, -14, -199], [73, -134, -118], [-115, -156, 82, -31], [44, -33], [-89, 82, -189, 94, -156, 75]]
[EX A]:
[100, -63, -10, 73, 82, 44, 94]