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:
[[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
answer:
[-47, 0, -11, 6, 85, 50]


question:
[[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]
answer:
[-17, 5, 41, 4, -46, 80, 92, 65, 69]


question:
[[57, 38, -13, 97, 39, -159, -31], [-90, -146, 29], [-35, -22], [-170, -23, -190], [92, 47, 29, -87, 4]]
answer:

[97, 29, -22, -23, 92]