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]: [[-143, 33, -146], [-82, -145, -105, -21], [0, -95, -164], [-153, 9, 51, 84, 71, -82], [5, 73, 67, -153, 11, -136], [-1, 81, -75, -41], [-102, -43, 69, -150]]
[EX A]: [33, -21, 0, 84, 73, 81, 69]

[EX Q]: [[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]
[EX A]: [86, 56]

[EX Q]: [[27, 27, -170, 13, -35, -26], [-147, -140], [85, 73, 27, -133, -58, 1, 5], [-45, 37], [-63, -179, 24], [-93, 16, 35, -44], [4, -75, -192, 76, 50, -6, -39], [50, -56, 98, 76, 65, -172]]
[EX A]:
[27, -140, 85, 37, 24, 35, 76, 98]