Alice and Bob are playing a game on strings.

Initially, they have some string $t$. In one move the first player selects the character $c$ present in $t$ and erases all it's occurrences in $t$, thus splitting $t$ into many smaller strings. The game then goes independently with each of the strings — to make the move player selects one of the strings and one of the characters there, deletes all occurrences and adds the remaining string back to the game.

Alice always starts the game, and then Alice and Bob take turns making moves. The player who is unable to make a move (because there is no string left) loses.

Alice and Bob used to always start with a string $s$, but recently they found out that this became too boring. Now before each game they choose two integers $l$ and $r$ such that $1 \le l \le r \le |s|$ and play the game with the string $s_{l} s_{l+1} s_{l+2} \ldots s_{r}$ instead.

Given the string $s$ and integers $l$, $r$ for each game. Find who is going to win each game assuming they are smart and are playing optimally.

The first line contains the string $s$ ($1 \le |s| \le 10^5$) consisting of lowercase English letters. This is the string Alice and Bob used to start with.

The second line contains a single integer $m$ ($1 \le m \le 10^5$) — the number of games to analyze.

Each of the next $m$ lines contains two integers $l$ and $r$ ($1 \le l \le r \le |s|$) — the bounds of the starting substring in the string $s$.

For each game output a single line containing the name of the winner — "Alice" or "Bob" respectively.