Seeking in a box

Suppose that we have a carton with old LPs placed horizontally the one on t o other in a column. In order to? find and? remove a LP it should we remove a-one LPs where they are found placed from on him and him to place next to carton. After we remove the LP that we seek, we reposition LPs in carton with way so that not is altered the line with which LPs had been placed initially in carton. Naturally it is absent what we removed, provided that it were found. For reasons of simplicity, each LP is depicted with unique entire code (ID). Write? a? C procedure that would accept as entry records one? up to? ? another, which presents a? carton with LPs and the ID that corresponds in a LP, it finds the LP this in? records one? up to? ? another and it removes with the process that was described more. Use possessed? records one? up to? ? another, in order to you represent the space and the way with which you will place provisionally LPs when becomes their export from carton at the search. In each movement, it will be supposed present in the screen suitable message. Carton? has up to N? LPs. For reasons of simplicity, you consider that N=50 and? the? records are one? up to? ? another with id from 1 until 50. Program should work even if records one up to another don't be in order 1 to 50.