#include "cstdio"
#include "stdlib.h"
#include "cstring"
#include "iostream"
#include "vector"
#include "deque"
#include "stack"
#include "string"
#include "sstream"
using namespace std;
int n, m;
int cmd;
int op1, op2;
bool rever;
int kase;
struct Node
{
int l;
int r;
};
Node nodes[100010];
void pickNode(int i)
{
int r = nodes[i].r;
int l = nodes[i].l;
nodes[r].l = l;
nodes[l].r = r;
}
void addLeft(int target, int i)
{
int l = nodes[target].l;
nodes[i].r = target;
nodes[target].l = i;
nodes[i].l = l;
nodes[l].r = i;
}
void addRight(int target, int i)
{
int r = nodes[target].r;
nodes[i].l = target;
nodes[target].r = i;
nodes[i].r = r;
nodes[r].l = i;
}
void printsNodes()
{
if (!rever)
{
int i = 0;
while (nodes[i].r != n + 1)
{
i = nodes[i].r;
cout << i << " ";
}
cout << endl;
}
else{
int i = n + 1;
while (nodes[i].l != 0)
{
i = nodes[i].l;
cout << i << " ";
}
cout << endl;
}
}
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
while (cin >> n && cin >> m)
{
rever = false;
for (int i = 1; i <= n; i++)
{
nodes[i].r = i + 1;
nodes[i].l = i - 1;
}
nodes[0].r = 1;
nodes[n + 1].l = n;
for (int i = 0; i < m; i++)
{
cin >> cmd;
int l, r;
if ((cmd == 1 || cmd == 2) && rever)
{
cmd = 3 - cmd;
}
switch (cmd)
{
case 1:
cin >> op1 >> op2;
if (nodes[op1].r != op2)
{
pickNode(op1);
addLeft(op2, op1);
}
break;
case 2:
cin >> op1 >> op2;
if (nodes[op1].l != op2)
{
pickNode(op1);
addRight(op2, op1);
}
break;
case 3:
cin >> op1 >> op2;
r = nodes[op1].r;
if (r != op2)
{
pickNode(op1);
addLeft(op2, op1);
pickNode(op2);
addLeft(r, op2);
}
else{
pickNode(op2);
addLeft(op1,op2);
}
break;
case 4:
rever = !rever;
break;
default:
break;
}
//if (kase == 0)
// printsNodes();
}
kase++;
cout << "Case " << kase << ": ";
long long sum = 0;
if (rever)
{
int i = nodes[n + 1].l;
int cnt = 1;
while (i != 0)
{
if (cnt % 2)
{
sum += i;
}
i = nodes[i].l;
cnt++;
}
}
else{
int i = nodes[0].r;
int cnt = 1;
while (i != n + 1)
{
if (cnt % 2)
{
sum += i;
}
i = nodes[i].r;
cnt++;
}
}
cout << sum << endl;
}
return 0;
}