python please

Stretch is to in the PROBLEM: Given a path t colmn tnd so thhd the 5 types of pieces shown below, the object of path goes to the leftmost column a conniected path across the grid If the initial piece is in nghtmost column. If the initial piece is in the rightmost column leftmost column, the path goes to the colum .A piece cannot be rotated or flipped .A piece can only c onnect to the last piece that was placed, It will connect one column to the right right-to lef, n the path is left to right OR one column to the left of that pece if the path is A pice can connect only at atle with a circle and the tiles with the circles are the only tiles are allowed to touch. I tiles of the connecting piece must be to the right (if left-to-right) or to the left if i of all previously placed pieces. *A piece cannot be placed in the grid such that it would cover any part of another piece, cover blocked cell, or extend beyond the grid. The one and only tile allowed to touch the starting side is a circle tile. The one and only tile allowed to touch the opposite side is a circle tile. Pieces are placed in alphabetical order. If a piece does not fit, skip it and use the next piece that fits. When Piece E is either used or skipped, then begin again with Piece A * Grid cells are numbered consecutively starting with 1 in the upper left coner and continue from We guarantee that if a piece can be placed, then that will be the only location that it can be left to right and from top to bottom. placed 12 3 4 5 67 9 10 OAI s116 | 17 | 1B | 19 | 20 21 22 23 B 25 26 30 41 42 43 44 CO 51 52 53 54 55 5 57 8 59 60 50 EXAMPLE: The example above is a 6 x 10 grid with a starting cell of 11. There are blocked cells at cells 48 and 49. Piece A is placed at I1. Piece B can only be placed at 14. The next piece must connect at either 15 or 35. Piece C cannot be placed at 15 because that would cause Pieces C and B to touch at iece D more than one tile Location 35 is legal so it is placed there cannot be placed there, nor can E or A. Piece B is placed a The next piece must connect at 47. P 28. Pieces C and D cannot be placed thers, but E, can. only place the next piece can go is at ere will be S lines of data. Each line will contain the numbers:r..s. s in the grid. s numbers. r indicates the number of rows in the grid. c indicates indicates the starting cell number for the first piece. n indicates numbers are the cells that are designated as blocked the number of colum the number of blocked cells. The next n OUTPUT: Form a path from the Print the starting cell to the opposite edge of the grid using the algorithm above. path in the order that they were placed in the grid eqence of pieces that were used to form the SAMPLE INPUT 6 10 11 2 48 49 5 10 40 1 27 6 14 70 4 66 33 7 56 9 12 108 5 69 106 77 91 55 6 13 78 1 49 SAMPLE OUTPUT 1. 2. ACDA 3. CECDE 5. ACDEA