#include<bits/stdc++.h>

#include<ext/rope>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

using namespace __gnu_cxx;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f;

struct Node{

    Node* ch[];

    int v;

    int s;

    int cmp(int x)const{

        int d = x - ch[]->s;

        if(d==)return -;

        return d<= ? :;

    }

    void maintain()

    {

        s =  + ch[]->s + ch[]->s;

    }

};

Node* null;

void Rotate(Node* &o,int d)

{

    Node* k = o->ch[d^];

    o->ch[d^] = k->ch[d];

    k->ch[d] = o;

    o->maintain();k->maintain();

    o = k;

}

void splay(Node* &o,int k)

{

    int d = o->cmp(k);

    if(d==)k -= o->ch[]->s + ;//利用二叉树性质

    if(d!=-)

    {

        Node* p = o->ch[d];

        int d2 = p->cmp(k);

        int k2 = (d2== ? k:k-p->ch[]->s-);

        if(d2!=-)

        {

            splay(p->ch[d2],k2);

            if(d==d2)Rotate(o,d^);

            else Rotate(o->ch[d],d);

        }

        Rotate(o,d^);

    }

}

Node* Merge(Node* left,Node* right)

{

    splay(left,left->s);//把排名最大的数splay到根

    left->ch[] = right;

    left->maintain();

    return left;

}

void split(Node* o,int k,Node* &left,Node* &right)

{

    splay(o,k);//把排名为k的节点splay到根，右侧子树所有节点排名比k大，左侧小

    right = o->ch[];

    o->ch[] = null;

    left = o;

    left->maintain();

}

Node *root;

void init(int sz)

{

    null=new Node;

    null->s=;

    root=new Node;

    root->v=;

    root->ch[]=root->ch[]=null;

    root->maintain();

    Node* p;

    for(int i=;i<=sz;i++)

    {

        p=new Node;

        p->v=i;p->s=;

        p->ch[]=root,p->ch[]=null;

        root=p;

        root->maintain();

    }

}

void deletetree(Node* &o)

{

    if(o!=null)

    {

        deletetree(o->ch[]);

        deletetree(o->ch[]);

        delete o;

    }

}

int main()

{

    int t,cnt=;

    scanf("%d",&t);

    while(t--)

    {

        int n,m;

        scanf("%d%d",&n,&m);

        init(n+);

        ll ans=;

        while(m--)

        {

            int a;

            scanf("%d",&a);

            Node *o,*left,*mid,*right;

            split(root,a,left,o);

            split(o,,mid,right);

            ans+=mid->v-;

            root = Merge(Merge(left,right),mid);

        }

        printf("Case %d: %lld\n",++cnt,ans);

        deletetree(root);

        delete null;

    }

    return ;

}

/************

************/