1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<map>
#include<stack>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const LL mod=1e9+7;
const double eps=1e-10;
#define N 100005
int Abs(int x)
{
    return x>0?x:-x;
}
int main()
{
//    freopen("test1.in","r",stdin);
//    freopen("test1.out","w",stdout);
    int T,n,q,s,l,r,k,kase=1,a[1005];
    scanf("%d",&T);
    while(T--)
    {
        printf("Case #%d:\n",kase++);
        scanf("%d%d",&n,&q);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX