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:
[[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]
answer:
[-68, 43, 91, 96, 85, 80]


question:
[[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]
answer:
[-7, 71, 29, 59, 93, 71]


question:
[[-167, -159, 39, -88, 48], [-141, 36, -183], [-141, -164, -66, 83, -103], [17, 43, -154, -153, -190, 67], [-21, -75, 60, -119, 45, -103, -158], [-128, -163]]
answer:

[48, 36, 83, 67, 60, -128]