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:
[[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
answer:
[71, 71, -38, 60, 7, 97, 76]


question:
[[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]
answer:
[-20, 93, 17, 91, 69, 44, -21, 98, 25]


question:
[[-167, -37, -70, -42], [-176, -178, -139, 91], [86, 80, -118, -159, -39, -186], [-12, -57, 49, 61], [29, -144, -90, -145, 30, -198, -7], [-173, 71, 75, -157], [2, -61, -15, -136, -192], [71, -141, 2]]
answer:

[-37, 91, 86, 61, 30, 75, 2, 71]