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]: [[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]
[EX A]: [-15, 69]

[EX Q]: [[-185, -69, -113, -63], [-34, -136, -40, 15, -35], [-137, 15, -56, -21, 53], [-194, 92, -23, -73], [-26, -114, -114, -15, 98], [-25, -42, -163, -26]]
[EX A]:
[-63, 15, 53, 92, 98, -25]