COCI '15 Contest 5 #1 Zamka

View as PDF

Submit solution

Points: 3
Time limit: 1.0s
Memory limit: 64M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

The impossible has happened. Bear G. has fallen into his own trap. Lured by a delicious box of Domaćica, without even thinking, he rushed and fell into his trap. In order to get out of the trap, he must solve the following task with your help. You are given three integers L, D and X.

  • determine the minimal integer N such that L \le N \le D and the sum of its digits is X
  • determine the maximal integer M such that L \le M \le D and the sum of its digits is X

Bear will be able to escape from the trap if he correctly determines numbers N and M. The numbers N and M will always exist.

Input

The first line of input contains the integer L (1 \le L \le 10\,000), the number from the task.

The second line of input contains the integer D (1 \le D \le 10\,000, L \le D), the number from the task.

The third line of input contains the integer X (1 \le X \le 36), the number from the task.

Output

The first line of output must contain the integer N from the task.

The second line of output must contain the integer M from the task.

Sample Input 1

1
100
4

Sample Output 1

4
40

Sample Input 2

100
500
12

Sample Output 2

129
480

Sample Input 3

1
10000
1

Sample Output 3

1
10000

Comments

There are no comments at the moment.