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]: [[-45, -38], [-74, -64, -89], [-113, 74, 59, -86], [28, 57, -77, -99, 95], [-193, -88, -89, 85]]
[EX A]: [-38, -64, 74, 95, 85]

[EX Q]: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]
[EX A]: [57, 40, 81, 17, 4]

[EX Q]: [[90, 13, -154, -5, 63, 67, 78], [23, 13], [91, -43, 61, -27], [-198, -123, -60, 35, 3, 64, -31], [-151, 24, -47, 32, 3, -1], [-127, 67, -19], [1, 82, -46]]
[EX A]:
[90, 23, 91, 64, 32, 67, 82]