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:
[[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]
answer:
[84, 58, 37, 81, 58, 31, -135]


question:
[[-166, 3, -5, -99, -138, -161], [-57, -150, -165, -173, -42, -119, 15], [-56, -79, -48, 17], [-18, 57, -129, -20, -99, -111], [-120, -191, -196, -30], [-163, -24, 56], [-196, -8, 84, 62, -45, -19, 77], [63, -18, 37]]
answer:
[3, 15, 17, 57, -30, 56, 84, 63]


question:
[[-83, 48, -154], [-62, -90, 33, -74, 24], [-103, 24, -117, 46, -160], [-30, -125, 80, -116, 10], [-126, -87, 66], [88, -78, 52, -135, 1, 26, 57]]
answer:

[48, 33, 46, 80, 66, 88]