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]: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]
[EX A]: [-76, -61, 22, 62]

[EX Q]: [[-169, -104, 48, -186, 57, -108], [-36, 65, -62, -91, 58, 55, -136], [-107, -18], [-52, -153, 45, -119, -105, 18], [65, 58, -15, -79, 82, -93], [-178, 96, -64], [44, -116, -197, -109, -15], [-161, 23, -115, -148, -175, -189, -175]]
[EX A]: [57, 65, -18, 45, 82, 96, 44, 23]

[EX Q]: [[-1, 68, -163, -165, -146, 70], [39, -157, -95, -117, -192, -183, 38], [-182, -52, 42, 2, 13, 87, -105], [83, 34, -74, 86, 3, -21], [-169, 74, -27, -193, -154], [-49, -120, -15], [-170, -92, 21, -120, 23, -131, 80], [45, -40, -25, -200]]
[EX A]:
[70, 39, 87, 86, 74, -15, 80, 45]