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]: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
[EX A]: [81, -36, 35, 65, 59, -31, 33, 89, 98]

[EX Q]: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]
[EX A]: [-16, 68, 80, -85, -15, 94, 69]

[EX Q]: [[45, -190, 96, -151, 35, 93], [-97, -82, 94, 57, -64, -188], [-145, -195, -144, -177, -49, -164, -11]]
[EX A]:
[96, 94, -11]