Author:  A. Karabanov, A. Baranov  Time limit:  1 sec  
Input file:  Standard input  Memory limit:  256 Mb  
Output file:  Standard output 
The task at hand involves finding the kth sequentially ordered qary number (starting from the 1st),
where the sum of its digits equals n, and its length does not exceed l.
Four integers are provided in the input data: q, n, l and k.
The output data should contain the resulting number.
If such a number does not exist or if it exceeds the permissible range,
the output data should remain empty.
2 ≤ q ≤ 10, 1 ≤ (n, l) ≤ 4000, 1 ≤ k ≤ 10^{18}
No.  Standard input  Standard output 

1 


2 

