instruction:
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.
question:
[[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
answer:
[-105, 97, 59, 80, -47, -51, 9, 70, 81]


question:
[[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]
answer:
[79, 56, -1, 85, 89, 61, -62, 31]


question:
[[-64, -190, 53, -142, -189], [-22, 20, -109, -100], [7, 59, 87, 92], [85, -73, -57, -95, -105], [-193, -112, -112, -10, 68, 74], [-89, 18, -61, 92, -178, -24, 0], [87, 100, 62, -43, -83, -186, -17], [-110, 15, -62, 48]]
answer:

[53, 20, 92, 85, 74, 92, 100, 48]