#include <iostream>
#include <cstring>
#include <cstdio>
#define maxn 262145
using namespace std;int a[maxn*4],val[maxn*4];
int tmp;
__int64 sum;void pushup(int rt)
{a[rt] = a[rt<<1] + a[rt<<1|1];
}
void build(int l,int r,int rt)
{if (l == r){a[rt] = 1;val[rt] = ++tmp;return ;}int m = (l + r)>>1;build(l,m,rt<<1);build(m + 1,r,rt<<1|1);pushup(rt);
}
void update(int sc,int l,int r,int rt)
{if (l == r){a[rt] = 0;sum += val[rt];return ;}int m = (l + r)>>1;if (sc <= a[rt<<1]) update(sc,l,m,rt<<1);else{sc -= a[rt<<1];update(sc,m + 1,r,rt<<1|1);}pushup(rt);
}
int main()
{int n,q,t,c;int cas = 1;scanf("%d",&t);while (t--){for (int i = 0; i < 4*maxn; ++i) a[i] = val[i] = 0;tmp = 0;scanf("%d%d",&n,&q);sum = 0;build(1,n,1);while (q--){scanf("%d",&c);update(c,1,n,1);}printf("Case %d: %I64d\n",cas++,sum);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>#define CL(a,num) memset((a),(num),sizeof(a))
#define iabs(x)  ((x) > 0 ? (x) : -(x))
#define Min(a,b) (a) > (b)? (b):(a)
#define Max(a,b) (a) > (b)? (a):(b)#define ll __int64
#define inf 0x7f7f7f7f
#define MOD 1000000007ll
#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)
#define test puts("<------------------->")
#define maxn 100010
#define N 1000005
#define M 200007
using namespace std;int val[maxn<<2];
int pos[maxn];void pushup(int rt)
{val[rt] = val[rt<<1] + val[rt<<1|1];
}
void build(int l,int r,int rt)
{if (l == r){val[rt] = 1;return ;}int m = (l + r)>>1;build(lc);build(rc);pushup(rt);
}
void update(int pos,int l,int r,int rt)
{if (l == r){val[rt] = 0;return ;}int m = (l + r)>>1;if (pos <= m) update(pos,lc);else update(pos,rc);pushup(rt);
}
int query(int L,int R,int l,int r,int rt)
{if (l >= L && r <= R) return val[rt];int res = 0;int m = (l + r)>>1;if (L <= m) res += query(L,R,lc);if (R > m) res += query(L,R,rc);return res;
}
int getpos(int s,int l,int r,int rt)
{if (l == r) return l;int m = (l + r)>>1;if (s <= val[rt<<1]) return  getpos(s,lc);else{s -= val[rt<<1];return  getpos(s,rc);}
}
int main()
{//freopen("din.txt","r",stdin);int n,i,a;while (~scanf("%d",&n)){if (!n) break;for (i = 1; i <= n; ++i){scanf("%d",&a);pos[a] = i;//标记第a个被扔出去的编号
        }build(1,n,1);int curpos = 1;//当前在手中的点的标号ll ans = 0;for (i = 1; i <= n; ++i){int tmp = 0;if (curpos == pos[i]) ans += 1;//只剩一个点了else if (curpos < pos[i])//1 2 3 4 5； 3要被删除
            {tmp = query(curpos + 1,pos[i],1,n,1);ans += (min(tmp,n - i + 1 - tmp) + 1);//n - i + 1 - tmp就是顺时针的个数了，这里比赛时写麻烦了
            }else//同理
            {tmp = query(pos[i],curpos - 1,1,n,1);ans += (min(tmp,n - i + 1 - tmp) + 1);}//printf(">>%d %d %d %d\n",tmp,n - i + 1 - tmp,Min(tmp,n - i + 1 - tmp),(Min(tmp,n - i + 1 - tmp) + 1));//这里发现了用宏定义的Min不行出错update(pos[i],1,n,1);int s = query(1,pos[i],1,n,1);if (s < n - i)//如果pos[i]后面还有未被删除的点curpos = getpos(s + 1,1,n,1);else//如果没有就找第一个未被删除的点curpos = getpos(1,1,n,1);}printf("%I64d\n",ans);}return 0;
}