#### You are given two positive integers ‘L’ and ‘R’. Find all the Stepping Numbers in the range [L, R].

#### A positive integer is called a Stepping Number if the adjacent digits have a difference of 1. For example, 121 is a Stepping Number because |1-2| = 1 and |2 -1| = 1. All single-digit integers will also be considered as Stepping Numbers.

#### You should return a list of Stepping Numbers between ‘L’ and ‘R’ (inclusive) in the increasing order.

##### For Example:

```
Consider L = 10, R = 13.
Then, all integers in range [10, 13] are 10, 11, 12, 13.
We can say, that 10 is a stepping number because |1 - 0| = 1.
11 is not a stepping number because |1 - 1| = 0.
12 is a stepping number because |1 - 2| = 1.
13 is not a stepping number because |1 - 3| = 2.
Thus, we should return a list [10, 12].
```

```
The first line of input contains an integer ‘T’ denoting the number of test cases. Then, ‘T’ test cases follow.
The first and the only line of each test case consist of two space-separated integers ‘L’ and ‘R’ respectively.
```

```
For each test case, if there are ‘K’ stepping numbers between ‘L’ and ‘R’, then print a single line consisting of ‘K’ space-separated integers representing Stepping Numbers between ‘L’ and ‘R’ in increasing order.
```

##### Note:

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

##### Constraints:

```
1 <= T <= 50
1 <= L <= 10^8
1 <= R <= 10^8
R >= L
Time Limit: 1 second
```

##### Sample Input 1:

```
2
1 5
10 13
```

##### Sample Output 1:

```
1 2 3 4 5
10 12
```

##### Explanation For Sample Output 1:

```
Test case 1:
Single-digit integers are stepping numbers, Thus all integers in the range [1, 5] will be stepping numbers.
Test case 2:
See the problem statement for an explanation.
```

##### Sample Input 2:

```
2
23 50
22 23
```

##### Sample Output 2:

```
23 32 34 43 45
23
```