CF761D Dasha and Very Difficult Problem

Dasha logged into the system and began to solve problems. One of them is as follows: Given two sequences $ a $ and $ b $ of length $ n $ each you need to write a sequence $ c $ of length $ n $ , the $ i $ -th element of which is calculated as follows: $ c_{i}=b_{i}-a_{i} $ . About sequences $ a $ and $ b $ we know that their elements are in the range from $ l $ to $ r $ . More formally, elements satisfy the following conditions: $ l

The first line contains three integers $ n $ , $ l $ , $ r $ $ (1

If there is no the suitable sequence $ b $ , then in the only line print "-1". Otherwise, in the only line print $ n $ integers — the elements of any suitable sequence $ b $ .

Sequence $ b $ which was found in the second sample is suitable, because calculated sequence $ c=[2-3,2-4,2-8,9-9]=[-1,-2,-6,0] $ (note that $ c_{i}=b_{i}-a_{i} $ ) has compressed sequence equals to $ p=[3,2,1,4] $ .