Problem Statement

You are given integers L and R.

Find how many integers are between L and R, inclusive.

Constraints

• 1\le L\le R\le 100
• All input values are integers.

Sample Input 1

3 5

Sample Output 1

3

The integers between 3 and 5, inclusive, are 3,4,5, which is three integers. Thus, output 3.

Sample Input 2

1 7

Sample Output 2

7

Sample Input 3

14 79

Sample Output 3

66

Problem Statement

You are given a string S consisting of lowercase English letters and a positive integer N. The length of S is at least 2N+1.

Find the string obtained by removing N characters from the beginning and N characters from the end of S.

Constraints

• S is a string consisting of lowercase English letters.
• N is an integer.
• 2N+1 \leq |S| \leq 30
• 1 \leq N \leq 10

Sample Input 1

chemotherapy
3

Sample Output 1

mother

Removing the first three characters (che) and the last three characters (apy) from chemotherapy gives mother.

Sample Input 2

thermometer
4

Sample Output 2

mom

Sample Input 3

burger
1

Sample Output 3

urge

Problem Statement

You are given a string S consisting of lowercase English letters. Find the character that appears most frequently in S. If multiple such characters exist, report the one that comes earliest in alphabetical order.

Constraints

• 1 \leq |S| \leq 1000 (|S| is the length of the string S.)
• Each character in S is a lowercase English letter.

Sample Input 1

frequency

Sample Output 1

e

In frequency, the letter e appears twice, which is more than any other character, so you should print e.

Sample Input 2

atcoder

Sample Output 2

a

In atcoder, each of the letters a, t, c, o, d, e, and r appears once, so you should print the earliest in alphabetical order, which is a.

Sample Input 3

pseudopseudohypoparathyroidism

Sample Output 3

o

Problem Statement

You are given a positive integer X.

Find the minimum value among all positive integers that can be obtained by rearranging the digits appearing in the decimal representation of X (without leading zeros) such that there is no leading zero.

Constraints

• 1\leq X < 10^5
• X is an integer.

Sample Input 1

903

Sample Output 1

309

There are four positive integers that can be obtained by rearranging the digits appearing in the decimal representation of X such that there is no leading zero: 903, 930, 309, 390; the minimum value among them is 309.

Sample Input 2

432

Sample Output 2

234

Sample Input 3

100

Sample Output 3

100

Problem Statement

A bag contains N balls numbered 1 to N. Ball i has the integer A_i written on it.
Process Q queries.
For each query, a sequence B_1, B_2, \dots, B_{K} of length K is given, and you should perform the following sequence of operations. Here, all B_i are between 1 and N inclusive and are distinct.

• First, remove balls B_1, B_2, \dots, B_K from the bag.
• Then, output the minimum value among the integers written on the balls currently in the bag. (It is guaranteed by the constraints that the bag is not empty at this point.)
• Afterwards, return all K removed balls to the bag.

Constraints

• 6 \leq N \leq 3 \times 10^5
• 1 \leq Q \leq 2 \times 10^5
• 1 \leq A_i \leq 10^9
• 1 \leq K \leq 5
• 1 \leq B_1 \lt B_2 \lt \dots \lt B_K \leq N
• The sum of K over all queries is at most 4 \times 10^5.
• All input values are integers.

Sample Input 1

6 6
3 2 5 9 1 2
2
4 5
5
1 2 3 4 6
3
2 5 6
4
1 2 5 6
1
5
3
1 2 3

Sample Output 1

2
1
3
5
2
1

For example, in the first query, balls 4 and 5 are removed from the bag. At this point, the following four balls remain in the bag:

• Ball 1 with 3 written on it
• Ball 2 with 2 written on it
• Ball 3 with 5 written on it
• Ball 6 with 2 written on it

Thus, the minimum value among the integers written on the balls in the bag is 2.