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]: [[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]: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
[EX A]: [-57, 95, 65, -1, 100, 55, 31, 94]

[EX Q]: [[74, -166, 68, -55, -11, -168, 98], [-152, 60, -22, -84], [69, 61, -105, -191, -192, 58, 42], [41, -22, 33], [-129, 58], [12, 84, 52, -45], [-153, 29], [-35, -88, -70, 57, 44, -72], [-160, -57]]
[EX A]:
[98, 60, 69, 41, 58, 84, 29, 57, -57]