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.
[[-33, 59], [33, 54, -145, -67, -115], [-36, -19, 64, 51, -40], [-19, -23, -38, 85, -9, -82], [11, -21, -179, 28, -116, -121, -64], [39, 7, -171, -87, -130, -66], [28, -20, -184, -181]]