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]: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[A]: [63, 2, 29, 18, 98]


[Q]: [[79, 50], [90, 81, -105]]
[A]: [79, 90]


[Q]: [[-164, -11, -132], [-199, -104, -103, -2, -165, -43, -52], [-14, 79, -188], [-182, 19, -69, -4, -185, 11, -10], [96, -181, 26, 42, -15], [14, 70, -170, -92, -69], [-160, -138, -185, -153, 35, 13, -29], [-54, -115, -106]]
[A]:
[-11, -2, 79, 19, 96, 70, 35, -54]