**Problem Description**

There are two sequences of numbers a

_{1}, a

_{2},..., a

_{n}(A) and b

_{1}, b

_{2},..., b

_{n}(B), if for any 1<= i, j <= n, they meet one of the following three cases:

(1) a

_{i}<a

_{j}and b

_{i}<b

_{j}

(2) a

_{i}=a

_{j}and b

_{i}=b

_{j}

(3) a

_{i}>a

_{j}and b

_{i}>b

_{j}

Then the two sequences are called "CC similar".

Now, CC gets a sequence A of length n and a sequence B of length m.He wants to know how many consecutive subsequences in B are "CC similar" with A.

**Input**

The first line has a positive integer T, indicating the number of input data cases

each case has three lines:

The first line has two positive integers n,m(1<= n,m <= 1e5),representing the length of A,B.

The second line has n positive integers : a

_{1}, a

_{2},..., a

_{n}(1<=a

_{i}<=30)

The third line has m positive integers : b

_{1}, b

_{2},..., b

_{m}(1<=b

_{j}<=30)

**Output**

For each sample, output a line "Case #x: Y", x stands for the number of samples (starting from 1), Y represents how many consecutive sub sequences in B is "CC similar" with A.

**Sample Input**

2 2 4 1 2 3 4 5 2 3 5 2 3 3 1 4 4 6 8

**Sample Output**

Case #1: 2 Case #2: 1

**Source**

2017绍兴市技能竞赛