Longest Unique Substring Queries

You are given a string $s$ and an integer $q$ denoting the number of queries. Each query is defined by two integers $l$ and $r$, representing the range (1-indexed) within the string. For each query, consider the substring $s[l \ldots r]$ and determine the length of the longest substring within this segment that contains only unique characters.

The problem requires you to read input from standard input and print the answer for each query on a new line to standard output. Use efficient techniques (such as the sliding window algorithm) to solve the problem.

inputFormat

The input is provided via standard input in the following format:

1. The first line contains the string $s$.
2. The second line contains an integer $q$, the number of queries.
3. Each of the next $q$ lines contains two space-separated integers $l$ and $r$, representing a query.

It is guaranteed that $1 \leq l \leq r \leq |s|$.

outputFormat

For each query, output a single integer representing the length of the longest substring with all unique characters in the specified range. Each result should be printed on its own line via standard output.## sample

abcdea
3
1 5
2 4
1 6

5
3
5