Develop a Python script that leverages both Stack and Queue data structures, ensuring it is robust enough to accommodate future modifications - an approach in line with defensive programming principles. The Stack and Queue should be implemented using Python lists. For a more professional touch, construct appropriate functions for each data structure, and consider encapsulating these within their respective classes. The script should establish a stack representing prisoners assigned to a yard cleaning task. However, the lazier a prisoner is, i.e., the later they arrive at the center of the yard, the more likely they are to be allocated the cleaning duty. The cleaning operation requires only 10 individuals from a group of 50 prisoners. Upon completion of the cleaning task, the prisoners are to dine. The principle of "first come, first served applies here - those who arrive first for dinner are served first. Note, however, that there is enough food for only 20 prisoners. To excel in this task, make sure to properly define and implement the classes. Furthermore, provide a test case that demonstrates the functioning of the program, particularly showing the names of the prisoners who participated in cleaning and those who had their dinner. Input A list of prisonners. Output A print of list of prisoners who cleaned the yard and those who ate dinner. The input source should be in rando so the output will different each time we run the program. Dont forget to explain how is you programming a defensive programming.