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:
[[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]
answer:
[76, 41, 90, 32, 39]


question:
[[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]
answer:
[100, 97, 77, 11, 52, 74, 99, -25, 8]


question:
[[-156, -172, 81, 97], [-45, 18, -38, -94], [-167, -7, -107, -165, -65, -171], [-47, -200, -49, -102, 11, -106], [-157, 99, -48, -39, -3], [-158, -27, -58, -15, -146, 100, 24], [21, -32, -182, -173, 94]]
answer:

[97, 18, -7, 11, 99, 100, 94]