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.

[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]]
[A]: [82, -62, 5, 98, 100, 56, 64, 54]


[Q]: [[-14, -21, 36, -53, -155, -43], [-83, 77, 97, -108, -117, 62, 5], [83, -147, -157, -169, -41], [-10, 92, -27], [-180, 1, -47], [-104, 1, -149]]
[A]: [36, 97, 83, 92, 1, 1]


[Q]: [[58, -72, -74], [-76, -150], [-64, -91, -115, -196], [-127, 54, -137, -165, -163, -32, -33]]
[A]:
[58, -76, -64, 54]


