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]: [[68, 82, -140, -80, -74, -135], [-154, -62, -78], [5, -153, -4, -88], [98, -78, 78], [57, -145, -49, -22, -67, 100], [-40, -152, 56, 49, -93, -138, 48], [-168, -137, 64, -103, -117], [-38, 2, -126, -106, -192, -160, 54]]
[EX A]: [82, -62, 5, 98, 100, 56, 64, 54]

[EX Q]: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]
[EX A]: [97, 23]

[EX Q]: [[74, 21, 91, 83], [-178, 100, -81, -59, -88, -69], [64, -33, 58, -182, -31, 29], [-189, 36, 5, -58], [5, 53, -73, -70], [-158, 40]]
[EX A]:
[91, 100, 64, 36, 53, 40]