Problem:
Structured Programming

In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, you can implement, for example, loops.

Note that use of goto statement is highly discouraged, because it is difficult to trace the control flow of a program which includes goto.

Write a program which does precisely the same thing as the following program (this example is wrtten in C++). Let's try to write the program without goto statements.

void call(int n){
int i = 1;
CHECK_NUM:
int x = i;
if ( x % 3 == 0 ){
cout << " " << i;
goto END_CHECK_NUM;
}
INCLUDE3:
if ( x % 10 == 3 ){
cout << " " << i;
goto END_CHECK_NUM;
}
x /= 10;
if ( x ) goto INCLUDE3;
END_CHECK_NUM:
if ( ++i <= n ) goto CHECK_NUM;

cout << endl;
}

Input

An integer n is given in a line.

Output

Print the output result of the above program for given integer n.

Constraints

3 ≤ n ≤ 10000

Sample Input

30

Sample Output

3 6 9 12 13 15 18 21 23 24 27 30

Put a single space character before each element.

Solution in Scala (judge verdict: Wrong Answer)


object Main {
	def main(args: Array[String]): Unit = {
	  val in = new java.util.Scanner(System.in)
	  val n =  in.nextInt
	  call(1,n)
	}
	def call(n : Int,lim:Int): Unit = {
	  if (lim < n){
           println("")
           return
          }
	  val i = n
	  if(i % 3 == 0){
	    printf(" "+i)
	  }else{
	    callRec(i)
	  }
	  call(i+1,lim)
	}
	def callRec(n:Int):Unit={
	  if(n == 0) return
	  if(n % 10 == 3) {
	    printf(" "+n)
	    return
	  }
	  callRec(n/10)
	}
}