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: [[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]]

A: [14, -43, -3, 14, 56, 61, -19, 97, -14]
****
Q: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]

A: [24, 93, 61, 79]
****
Q: [[-129, -84, -121, -154, -37, -143, 40], [98, 57, -54, -88, -147, 77, 50], [-61, -28, -86, -42], [-134, -35]]

A:
[40, 98, -28, -35]
****