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]: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
[EX A]: [79, -33, 2, 42, 81, -142, 71]

[EX Q]: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]
[EX A]: [82, -35, 37, 86, 1, 46, 99]

[EX Q]: [[-180, -35, -104, 1, -185, -161], [-78, -119, 61, -187], [15, -90], [-45, -48, -82, 9, -192, 45, 20], [26, 94, 90, -156]]
[EX A]:
[1, 61, 15, 45, 94]