# Navigating Delivery Bot

At Codedamn, we've developed a new delivery bot to assist with an innovative dish distribution system. This bot is engineered to navigate along a linear path for testing purposes.

Initially positioned at a coordinate $x = X$, the bot is programmed to follow a series of $N$ commands, represented by a string $S$ of length $N$. Each character in the string is coded as 'L' or 'R', instructing the bot to move one step left (decreasing $x$ by $1$) or right (increasing $x$ by $1$), respectively.

Your task is to determine the total number of unique points the bot visits after executing all the commands. A point $p$ is considered visited if it is an integer and the bot's position before or after executing any command is $x = p$.

### Input

- The input begins with a single integer $T$, indicating the number of test cases. Each test case is described in the following lines.
- The first line of each test case contains two integers $N$ and $X$, separated by a space.
- The subsequent line presents a string $S$ with a length of $N$.

### Output

For every test case, output a single line with one integer - the count of distinct points the bot visits.

### Constraints

- $1 \le T \le 100$
- $1 \le N \le 100$
- $|X| \le 1,000,000$
- $S$ is composed solely of the characters 'L' and 'R'

### Sample Test Cases (with explanations)

### Case #1:

Input:

`2 6 10 RRLLLL 2 0 LL`

Output:

`5 3`

#### Explanation

**Example case 1:** The bot's journey was $10 \rightarrow 11 \rightarrow 12 \rightarrow 11 \rightarrow 10 \rightarrow 9 \rightarrow 8$.

**Example case 2:** The bot traversed the path $0 \rightarrow -1 \rightarrow -2$.