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]: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]
[EX A]: [-19, -112, 30, 59, 65, -7, -16, 86, 39]

[EX Q]: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]
[EX A]: [-53, -98, 36]

[EX Q]: [[-107, -121, -157, -116, -12, -80, 76], [-178, -1, -124, -142, 81, -138, 94]]
[EX A]:
[76, 94]