Warehouse Pallet Arrangement

You are managing a warehouse, and you need to arrange pallets of different sizes on a single loading dock in a way that optimizes space usage. The loading dock can hold a maximum width of W. Given a list of integers representing the widths of the pallets, write a program that determines if it is possible to arrange all the pallets within the maximum width W without exceeding it. If possible, print the arrangement of widths; if not, print 'Not Possible'. Input Format: - The first line contains an integer W (1 <= W <= 100). - The second line contains an integer n (1 <= n <= 20), the number of pallets. - The next line contains n integers, representing the widths of the pallets. Output Format: - Print a single arrangement of pallets that fits within the width W, or 'Not Possible' if no such arrangement exists. Example: Input: 10 4 2 3 5 4 Output: 2 3 5