PROGRAMMING:Farmer crossing the river - breadth strategy

A farmer, with a wolf, a sheep and a cabbage, was on the South Bank of the river. He's going to transport all these things to the north bank. It's a pity that he has only one boat. The boat can only hold him and one object. It's only the farmer who's going to pull the boat here. At the same time, because wolves eat sheep and sheep eat cabbage, farmers can't leave sheep and wolves or sheep and cabbage alone on one side of the river and leave by themselves. Fortunately, wolves are carnivores and don't eat cabbage. How can the farmer transport everything safely across the river?
In order to indicate the location of each item, binary bits are used to distinguish the south bank from the north bank. 0 means on the south bank and 1 means on the north bank. The four binary bits of XXX are used to indicate the location of the farmer, wolf, vegetable and sheep. For example, 1110 means that farmers, wolves and vegetables are on the north bank, while vegetables are on the south bank. The initial state of the problem is 0000 and the end state is 1111.
###Input format:
No input
###Output format:
Output the reverse order of the intermediate state of the moving items
###Input example:
```in
```
###Output example:
```out
15 6 14 2 11 1 9 0
```







answer：If there is no answer, please comment