Problem:
Problem B:
Cubes Without Holes
There is a cube which consists of
n
×
n
×
n
small cubes. Small cubes have marks on their surfaces. An example where
n
= 4 is shown in the following figure.
Then, 
次に、上図（右）に示すように、印のついた表面から、反対の面まで水平または垂直に貫通する穴をあける。
あなたの仕事は、
n
と 印の位置を読み込み、穴の空いていない小さい立方体の個数を数えるプログラムを作成することである。
Input
入力はいくつかのデータセットからなる。各データセットは以下の形式で与えられる：
n h
c
1
a
1
b
1
c
2
a
2
b
2
.
   .
   .
c
h
a
h
b
h
h
は印の数を示す整数である。これに続く
h
行によって
h
個の印の位置が入力される。印の位置を指定するために下図に示す座標軸を用いることにする。(
x
,
y
,
z
) = (1, 1, 1) が左下奥の立方体、(
x
,
y
,
z
) = (
n
,
n
,
n
) が右上手前の立方体を示す。
c
i
は
i
番目の印がつけられている平面を示す文字列である。
c
i
は "
xy
" 、"
xz
"、 "
yz
"　のいづれかであり、それぞれ
i
番目の印が
xy
平面、
xz
平面、
yz
平面上にあることを示す。
a
i
,
b
i
は
c
i
で示された平面上の座標を示す。
xy
平面、
xz
平面、
yz
平面のとき、
a
i
,
b
i
はそれぞれ平面の座標 (
x
,
y
)、(
x
,
z
)、(
y
,
z
) を示す。例えば、上図において、印 A, B, C の
c
i
,
a
i
,
b
i
の値はそれぞれ、"
xy 4 4
", "
xz 1 2
", "
yz 2 3
" となる。
n
,
h
がともに 0 のとき、入力の終わりを示す。
n
≤ 500,
h
≤ 200 と仮定してよい。
Output
各データセットに対して、穴の空いていない立方体の数を１行に出力せよ。
Sample Input
4 3
xy 4 4
xz 1 2
yz 2 3
4 5
xy 1 1
xy 3 3
xz 3 3
yz 2 1
yz 3 3
0 0
Output for the Sample Input
52
46

Submitted solutions:

code_snippet: #include<set>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m;
set<int> s;
int Hash(int x,int y,int z)
{
    return x*n*n+y*n+z;
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF&&n)
    {
        s.clear();
        for(int i=0;i<m;i++)
        {
            getchar();
            char st[10];
            int pos1,pos2;
            scanf("%s%d%d",st,&pos1,&pos2);
            if(st[0]=='x')
            {
                if(st[1]=='y')
                {
                     for(int i=1;i<=n;i++)
                        s.insert(Hash(pos1,pos2,i));
                }
                else if(st[1]=='z')
                {
                     for(int i=1;i<=n;i++)
                           s.insert(Hash(pos1,i,pos2));
                }
            }
            else
            {
                  for(int i=1;i<=n;i++)
                       s.insert(Hash(i,pos1,pos2));
            }
        }
        printf("%d\n",n*n*n-s.size());
    }
    return 0;
}
accuracy: 1
time_ms: 30
memory_kb: 5796
final_rank: 3

code_snippet: #pragma region Macros

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")

#include <bits/extc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using namespace __gnu_pbds;

// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Bdouble = mp::number<mp::cpp_dec_float<256>>;
// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32
// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }

#define pb emplace_back
#define int ll
#define endl '\n'
// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> 

#define sqrt __builtin_sqrtl
#define cbrt __builtin_cbrtl
#define hypot __builtin_hypotl

#define next asdnext
#define prev asdprev

using ll = long long;
using ld = long double;
const ld PI = acosl(-1);
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;

const ld EPS = 1e-10;
const bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }

const vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗
const vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};

struct Edge {
    int from, to;
    double cost;
    Edge() : from(-1), to(-1), cost(-1) {}
    Edge(int to, double cost) : to(to), cost(cost) {}
    Edge(int from, int to, double cost) : from(from), to(to), cost(cost) {}
    bool operator ==(const Edge& e) {
        return this->from == e.from && this->to == e.to && this->cost == e.cost;
    }
    bool operator !=(const Edge& e) {
        return this->from != e.from or this->to != e.to or this->cost != e.cost;
    }
};
// struct Edge {
//     int from, to;
//     int cost;
//     Edge() : from(-1), to(-1), cost(-1) {}
//     Edge(int to, int cost) : to(to), cost(cost) {}
//     Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}
//     bool operator ==(const Edge& e) {
//         return this->from == e.from && this->to == e.to && this->cost == e.cost;
//     }
//     bool operator !=(const Edge& e) {
//         return this->from != e.from or this->to != e.to or this->cost != e.cost;
//     }
// };

chrono::system_clock::time_point start;
__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    start = chrono::system_clock::now();
}

random_device seed_gen;
mt19937_64 rng(seed_gen());
uniform_int_distribution<int> dist_x(0, 1e9);
struct RNG {
    unsigned Int(unsigned l, unsigned r) {
        return dist_x(rng) % (r - l + 1) + l;
    }
    ld Double() {
        return ld(dist_x(rng)) / 1e9;
    }
} rnd;

using i64 = ll;
// using i64 = uint64_t;
// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)
i64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }
i64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可
i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }

i64 popcount(i64 x) { return __builtin_popcountll(x); }
i64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }
i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }
i64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }
bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; }

i64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)
i64 bot_bit(i64 x) { return __builtin_ctz(x);} // 2^kの位 (x > 0)
// i64 next_bit(i64 x, i64 k) { return 0; }
// i64 prev_bit(i64 x, i64 k) { return 0; }
// i64 kth_bit(i64 x, i64 k) { return 0; }
i64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask
i64 LSB(i64 x) { return (x & -x); } // mask

i64 countl_zero(i64 x) { return __builtin_clzll(x); }
i64 countl_one(i64 x) {
    i64 ret = 0, k = 63 - __builtin_clzll(x);
    while (k != -1 && (x & (1LL << k))) { k--; ret++; }
    return ret;
}
i64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意
i64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }

i64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }
i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ
i64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }
i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }

i64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意
    i64 w = bit_width(x); k %= w;
    return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);
}
// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}
i64 rotr(i64 x, i64 k) {
    i64 w = bit_width(x); k %= w;
    return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);
}
// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}
i64 bit_reverse(i64 x) { // 有効bit内で左右反転
    i64 r = 0, w = bit_width(x);
    for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);
    return r;
}
// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }

bool is_palindrome(i64 x) { return x == bit_reverse(x); }
bool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }
i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意
i64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット

i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }
i64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }
i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }
i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数
i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数

i64 next_combination(i64 x) {
    i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctz(x) + 1));
}


__int128_t POW(__int128_t x, int n) {
    __int128_t ret = 1;
    assert(n >= 0);
    if (x == 1 or n == 0) ret = 1;
    else if (x == -1 && n % 2 == 0) ret = 1; 
    else if (x == -1) ret = -1; 
    else if (n % 2 == 0) {
        assert(x < INFL);
        ret = POW(x * x, n / 2);
    } else {
        assert(x < INFL);
        ret = x * POW(x, n - 1);
    }
    return ret;
}
int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq
    assert(y != 0);
    if (x >= 0 && y > 0) return x / y;
    if (x >= 0 && y < 0) return x / y - (x % y < 0);
    if (x < 0 && y < 0) return x / y + (x % y < 0);
    return x / y - (x % y < 0); //  (x < 0 && y > 0) 
}
int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr
    assert(y != 0);
    if (x >= 0) return x % y;
    __int128_t ret = x % y; // (x < 0)
    ret += (__int128_t)abs(y) * INFL;
    ret %= abs(y);
    return ret;
}
int floor(int x, int y) { // (ld)x / y 以下の最大の整数
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return x >= 0 ? x / y : (x + 1) / y - 1;
}
int ceil(int x, int y) { // (ld)x / y 以上の最小の整数
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return x > 0 ? (x - 1) / y + 1 : x / y;
}
int round(int x, int y) {
    assert(y != 0);
    return (x * 2 + y) / (y * 2);
}
int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入
    assert(y != 0); // TODO
    return INF;
}
int round2(int x, int y) { // 五捨五超入 // 未verify
    assert(y != 0);
    if (y < 0) y = -y, x = -x;
    int z = z / y;
    if ((z * 2 + 1) * y <= y * 2) z++;
    return z;
}
// int round(ld x, int k) { // xを10^kの位に関して四捨五入
// }
// int floor(ld x, int k) { // xを10^kの位に関してflooring
// }
// int ceil(ld x, int k) { // xを10^kの位に関してceiling
// }
// int kth(int x, int y, int k) { // x / yの10^kの位の桁
// }
int floor(ld x, ld y) { // 誤差対策TODO
    assert(!equals(y, 0));
    return floor(x / y);
    // floor(x) = ceil(x - 1) という話も
}
int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい
    assert(!equals(y, 0));
    return ceil(x / y);
    // ceil(x) = floor(x + 1)
}
int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q
    // 未verify. 誤差対策TODO. EPS外してもいいかも。
    assert(!equals(y, 0));
    if (x >= 0 && y > 0) return floor(x / y)+EPS;
    if (x >= 0 && y < 0) return -floor(x / fabs(y));
    if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);
    return floor(x / y) - (x - floor(x/y)*y < -EPS); //  (x < 0 && y > 0) 
}
ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r
    // 未verify. 誤差対策TODO. -0.0が返りうる。
    assert(!equals(y, 0));
    if (x >= 0) return x - fabs(y)*fabs(per(x, y));
    return x - fabs(y)*floor(x, fabs(y));
}
int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO
int modf(ld x) {
	if (x < 0) return ceill(x);
	else return floorl(x);
}
// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?
int seisuu(int x, int y) {
    assert(y != 0);
    return x / y;
}
int seisuu(ld x, ld y) { // 誤差対策TODO
    assert(!equals(y, 0));
    return (int)(x / y);
}

template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {
    if (a.first > b.first or a.first == b.first && a.second > b.second) return a;
    return b;
}
template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {
    if (a.first < b.first or a.first == b.first && a.second < b.second) return a;
    return b;
}

template <class T> bool chmax(T &a, const T& b) {
    if (a < b) { a = b; return true; } return false;
}
template <class T> bool chmin(T &a, const T& b) {
    if (a > b) { a = b; return true; } return false;
}
template <class T> T mid(T a, T b, T c) { // 誤差対策TODO
    return a + b + c - max({a, b, c}) - min({a, b, c});
}
template <class T> void Sort(T &a, T &b, bool rev = false) { 
    if (rev == false) {  // TODO テンプレート引数
        if (a > b) swap(a, b);
    } else {
        if (b > a) swap(b, a);
    }
}
template <class T> void Sort(T &a, T &b, T &c, bool rev = false) {
    if (rev == false) { 
        if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);
    } else {
        if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);
    }
}
template <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {
    if (rev == false) { 
        if (a > b) swap(a, b); if (a > c) swap(a, c);  if (a > d) swap(a, d);
        if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);
    } else {
        if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);
        if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);
    }
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

class Compress {
public:
    int sz = 0;
    // gp_hash_table<int, int, custom_hash> Z, UZ;
    unordered_map<int, int> Z;    // 元の値 -> 圧縮した値
    unordered_map<int, int> UZ;   // 圧縮した値 -> 元の値

    Compress(const vector<int> &V, int base = 0) {
        this->sz = base;
        set<int> s(V.begin(), V.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }
    
    Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {
        this->sz = base;
        vector<int> V3 = V2;
        V3.insert(V3.end(), V1.begin(), V1.end());
        set<int> s(V3.begin(), V3.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }

    Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {
        this->sz = base;
        vector<int> V4 = V1;
        V4.insert(V4.end(), V2.begin(), V2.end());
        V4.insert(V4.end(), V3.begin(), V3.end());
        set<int> s(V4.begin(), V4.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }

    Compress(const vector<int> &V1, const vector<int> &V2,
            const vector<int> &V3, const vector<int> &V4, int base = 0) {
        this->sz = base;
        vector<int> V5 = V1;
        V5.insert(V5.end(), V2.begin(), V2.end());
        V5.insert(V5.end(), V3.begin(), V3.end());
        V5.insert(V5.end(), V4.begin(), V4.end());
        set<int> s(V5.begin(), V5.end());

        for (int x : s) {
            this->Z[x] = this->sz;
            this->UZ[this->sz] = x;
            this->sz++;
        }
    }

    vector<int> zip(const vector<int> &V) {
        vector<int> ret = V;
        for (int i = 0; i < (int)V.size(); i++) {
            ret[i] = Z[ret[i]];
        }
        return ret;
    }

    vector<int> unzip(const vector<int> &V) {
        vector<int> ret = V;
        for (int i = 0; i < (int)V.size(); i++) {
            ret[i] = UZ[ret[i]];
        }
        return ret;
    }

    int size() { return sz; }

    int encode(int x) { return Z[x]; }
    int decode(int x) {
        if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき
        return UZ[x];
    }
};

class UnionFind {
public:
	UnionFind() = default;
    UnionFind(int N) : par(N), sz(N, 1) {
        iota(par.begin(), par.end(), 0);
    }
	int root(int x) {
		if (par[x] == x) return x;
		return (par[x] = root(par[x]));
	}
	bool unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);
        if (rx == ry) return false;
		if (sz[rx] < sz[ry]) swap(rx, ry);
		sz[rx] += sz[ry];
		par[ry] = rx;
        return true;
	}
	bool issame(int x, int y) { return (root(x) == root(y)); }
	int size(int x) { return sz[root(x)]; }
    vector<vector<int>> groups(int N) {
        vector<vector<int>> G(N);
        for (int x = 0; x < N; x++) {
            G[root(x)].push_back(x);
        }
		G.erase( remove_if(G.begin(), G.end(),
            [&](const vector<int>& V) { return V.empty(); }), G.end());
        return G;
    }
private:
	vector<int> par, sz;
};

template<typename T>
struct BIT {
    int N;             // 要素数
    vector<T> bit[2];  // データの格納先
    BIT(int N_, int x = 0) {
        N = N_ + 1;
        bit[0].assign(N, 0); bit[1].assign(N, 0);
        if (x != 0) {
            for (int i = 0; i < N; i++) add(i, x);
        }
    }
    BIT(const vector<int> &A) {
        N = A.size() + 1;
        bit[0].assign(N, 0); bit[1].assign(N, 0);
        for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);
    }
    void add_sub(int p, int i, T x) {
        while (i < N) { bit[p][i] += x; i += (i & -i); }
    }
    void add(int l, int r, T x) {
        add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);
        add_sub(1, l + 1, x); add_sub(1, r + 1, -x);
    }
    void add(int i, T x) { add(i, i + 1, x); }
    T sum_sub(int p, int i) {
        T ret = 0;
        while (i > 0) { ret += bit[p][i]; i -= (i & -i); }
        return ret;
    }
    T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }
    T sum(int l, int r) { return sum(r) - sum(l); }
    T get(int i) { return sum(i, i + 1); }
    void set(int i, T x) { T s = get(i); add(i, -s + x); }
};

template<int mod> class Modint {
public:
    int val = 0;
    Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    Modint(const Modint &r) { val = r.val; }

    Modint operator -() { return Modint(-val); } // 単項
    Modint operator +(const Modint &r) { return Modint(*this) += r; }
    Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }
    Modint operator -(const Modint &r) { return Modint(*this) -= r; }
    Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }
    Modint operator *(const Modint &r) { return Modint(*this) *= r; }
    Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }
    Modint operator /(const Modint &r) { return Modint(*this) /= r; }
    Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }
    
    Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置
    Modint operator ++(signed) { ++*this; return *this; } // 後置
    Modint& operator --() { val--; if (val < 0) val += mod; return *this; }
    Modint operator --(signed) { --*this; return *this; }
    Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }
    Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }
    Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }
    Modint &operator -=(const int &q) { Modint r(q);  if (val < r.val) val += mod; val -= r.val; return *this; }
    Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }
    Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }
    Modint &operator /=(const Modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }
    Modint &operator /=(const int &q) {
        Modint r(q); int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }
    bool operator ==(const Modint& r) { return this -> val == r.val; }
    bool operator <(const Modint& r) { return this -> val < r.val; }
    bool operator >(const Modint& r) { return this -> val > r.val; }
    bool operator !=(const Modint& r) { return this -> val != r.val; }
};

using mint = Modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t; x = t; return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}
mint modpow(const mint &x, int n) {
    if (n < 0) return (mint)1 / modpow(x, -n); // 未verify
    assert(n >= 0);
    if (n == 0) return 1;
    mint t = modpow(x, n / 2);
    t = t * t;
    if (n & 1) t = t * x;
    return t;
}

int modpow(__int128_t x, int n, int mod) {
    assert(n >= 0 && mod > 0); // TODO: n <= -1
    __int128_t ret = 1;
    while (n > 0) {
        if (n % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return ret;
}
int modinv(__int128_t x, int mod) {
    assert(mod > 0);
    // assert(x > 0);
    if (x == 1 or x == 0) return 1;
    return mod - modinv(mod % x, mod) * (mod / x) % mod;
}

istream &operator >>(istream &is, __int128_t& x) {
    string S; is >> S;
    __int128_t ret = 0;
    int f = 1;
    if (S[0] == '-') f = -1; 
    for (int i = 0; i < S.length(); i++)
        if ('0' <= S[i] && S[i] <= '9')
            ret = ret * 10 + S[i] - '0';
    x = ret * f;
    return (is);
}
ostream &operator <<(ostream &os, __int128_t x) {
    ostream::sentry s(os);
    if (s) {
        __uint128_t tmp = x < 0 ? -x : x;
        char buffer[128]; char *d = end(buffer);
        do {
            --d; *d = "0123456789"[tmp % 10]; tmp /= 10;
        } while (tmp != 0);
        if (x < 0) { --d; *d = '-'; }
        int len = end(buffer) - d;
        if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);
    }
    return os;
}

__int128_t stoll(string &S) {
    __int128_t ret = 0; int f = 1;
    if (S[0] == '-') f = -1; 
    for (int i = 0; i < S.length(); i++)
        if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';
    return ret * f;
}
__int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }
__int128_t lcm(__int128_t a, __int128_t b) {
    return a / gcd(a, b) * b;
    // lcmが__int128_tに収まる必要あり
}

string to_string(ld x, int k) { // xの小数第k位までをstring化する
    assert(k >= 0);
    stringstream ss;
    ss << setprecision(k + 2) << x;
    string s = ss.str();
    if (s.find('.') == string::npos) s += '.';
    int pos = s.find('.');
    for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';
    s.pop_back();
    if (s.back() == '.') s.pop_back();
    return s;

    // stringstream ss; // 第k+1位を四捨五入して第k位まで返す
    // ss << setprecision(k + 1) << x;
    // string s = ss.str();
    // if (s.find('.') == string::npos) s += '.';
    // int pos = s.find('.');
    // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';
    // if (s.back() == '.') s.pop_back();
    // return s;
}
string to_string(__int128_t x) {
    string ret = "";
    if (x < 0) { ret += "-"; x *= -1; }
    while (x) { ret += (char)('0' + x % 10); x /= 10; }
    reverse(ret.begin(), ret.end());
    return ret;
}
string to_string(char c) { string s = ""; s += c; return s; }

template<class T> size_t HashCombine(const size_t seed,const T &v) {
    return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));
}
template<class T,class S> struct hash<pair<T,S>>{
    size_t operator()(const pair<T,S> &keyval) const noexcept {
        return HashCombine(hash<T>()(keyval.first), keyval.second);
    }
};
template<class T> struct hash<vector<T>>{
    size_t operator()(const vector<T> &keyval) const noexcept {
        size_t s=0;
        for (auto&& v: keyval) s=HashCombine(s,v);
        return s;
    }
};
template<int N> struct HashTupleCore{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{
        size_t s=HashTupleCore<N-1>()(keyval);
        return HashCombine(s,get<N-1>(keyval));
    }
};
template <> struct HashTupleCore<0>{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }
};
template<class... Args> struct hash<tuple<Args...>>{
    size_t operator()(const tuple<Args...> &keyval) const noexcept {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};

vector<mint> _fac, _finv, _inv;
void COMinit(int N) {
    _fac.resize(N + 1); _finv.resize(N + 1);  _inv.resize(N + 1);
    _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;
    for (int i = 2; i <= N; i++) {
        _fac[i] = _fac[i-1] * mint(i);
        _inv[i] = -_inv[MOD % i] * mint(MOD / i);
        _finv[i] = _finv[i - 1] * _inv[i];
    }
}

mint FAC(int N) {
    if (N < 0) return 0; return _fac[N];
}
mint COM(int N, int K) {
    if (N < K) return 0; if (N < 0 or K < 0) return 0;
    return _fac[N] * _finv[K] * _finv[N - K];
}
mint PERM(int N, int K) {
    if (N < K) return 0; if (N < 0 or K < 0) return 0;
    return _fac[N] *  _finv[N - K];
}
mint NHK(int N, int K) { // initのサイズに注意
    if (N == 0 && K == 0)  return 1;
    return COM(N + K - 1, K);
}

#pragma endregion

signed main() {
    int N, M;
    while (cin >> N >> M, N) {
        vector<tuple<string, int, int>> T(M);
        for (int i = 0; i < M; i++) {
            string a;
            int b, c;
            cin >> a >> b >> c;
            T[i] = make_tuple(a, b, c);
        }

        int ans = N*N*N - N*M;
        for (int i = 0; i < M; i++) {
            string s = get<0>(T[i]);
            int a = get<1>(T[i]);
            int b = get<2>(T[i]);
            for (int j = i + 1; j < M; j++) {
                string t = get<0>(T[j]);
                int a2 = get<1>(T[j]);
                int b2 = get<2>(T[j]);

                if (s == "xy" && t == "yz" && b == a2) ans++;
                if (s == "xy" && t == "xz" && a == a2) ans++;

                if (s == "yz" && t == "xy" && a == b2) ans++;
                if (s == "yz" && t == "xz" && b == b2) ans++;

                if (s == "xz" && t == "xy" && a == a2) ans++;
                if (s == "xz" && t == "yz" && b == b2) ans++;
            }
        }

        for (int i = 0; i < M; i++) {
            string s = get<0>(T[i]);
            int a = get<1>(T[i]);
            int b = get<2>(T[i]);

            for (int j = i + 1; j < M; j++) {
                string t = get<0>(T[j]);
                int a2 = get<1>(T[j]);
                int b2 = get<2>(T[j]);

                for (int k = j + 1; k < M; k++) {
                    string u = get<0>(T[k]);
                    int a3 = get<1>(T[k]);
                    int b3 = get<2>(T[k]);

                    if (s == "xy" && t == "yz" && u == "xz" && b == a2 && a == a3 && b2 == b3) ans--;
                    if (s == "xy" && t == "xz" && u == "yz" && a == a2 && b == a3 && b2 == b3) ans--;

                    if (s == "yz" && t == "xy" && u == "xz" && a == b2 && b == b3 && a2 == a3) ans--;
                    if (s == "yz" && t == "xz" && u == "xy" && b == b2 && a == b3 && a2 == a3) ans--;

                    if (s == "xz" && t == "xy" && u == "yz" && a == a2 && b == b3 && b2 == a3) ans--;
                    if (s == "xz" && t == "yz" && u == "xy" && b == b2 && a == a3 && a2 == b3) ans--;
                }
            }
        }
        cout << ans << endl;
    }
}
accuracy: 1
time_ms: 50
memory_kb: 3188
final_rank: 4

code_snippet: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)

typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>using arr=vector<vector<T>>;
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} cout << a[a.size()-1] << endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

bool cub[500][500][500];
void solve(int n, int h){
    rep(i, n) rep(j, n) rep(k, n) cub[i][j][k] = true;

    string c;
    int a, b;
    rep(i, h){
        cin >> c >> a >> b;
        a--; b--;
        if(c == "xy") {
            rep(i, n) cub[a][b][i] = false;
        }else if(c == "xz"){
            rep(i, n) cub[a][i][b] = false;
        }else{
            rep(i, n) cub[i][a][b] = false;
        }
    }

    int ans = 0;
    rep(i, n) rep(j, n) rep(k, n) ans += cub[i][j][k];
    pr(ans);
    return;
}

int main()
{
    int n, h;
    while(cin >> n >> h){
        if(n==0 && h==0) break;
        solve(n, h);
    }
    return 0;}
accuracy: 1
time_ms: 840
memory_kb: 125088
final_rank: 20

code_snippet: #include<iostream>
#include<set>
#include<tuple>
using namespace std;

int main(){
    int n, h;
    while(cin >> n >> h, n+h){
        set<tuple<int,int,int>> s;
        string axis;
        int a, b;
        while(h-- > 0){
            cin >> axis >> a >> b;
            for(int i = 1; i <= n; i++){
                if(axis == "xy"){
                    s.insert(make_tuple(a,b,i));
                }else if(axis == "xz"){
                    s.insert(make_tuple(a,i,b));
                }else if(axis == "yz"){
                    s.insert(make_tuple(i,a,b));
                }
            }
        }
        cout << n*n*n - s.size() << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 6260
final_rank: 13

code_snippet: #include<iostream>
#include<set>
using namespace std;

int main(){
    int n, h;
    while(cin >> n >> h, n+h){
        set<pair<int,pair<int,int>>> s;
        string axis;
        int a, b;
        while(h-- > 0){
            cin >> axis >> a >> b;
            if(axis == "xy"){
                for(int i = 1; i <= n; i++)  s.insert({a,{b,i}});
            }else if(axis == "xz"){
                for(int i = 1; i <= n; i++)  s.insert({a,{i,b}});
            }else if(axis == "yz"){
                for(int i = 1; i <= n; i++)  s.insert({i,{a,b}});
            }
        }
        cout << n*n*n - s.size() << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 30
memory_kb: 6268
final_rank: 5

code_snippet: #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<pair<int,int>,int>P;
int main(){
	int n,m;
	while(cin>>n>>m,n){
		set<P>s;
		r(j,m){
			string S;
			int x,y;
			cin>>S>>x>>y;
			x--;y--;
			if(S=="xy")r(i,n)s.insert(P(make_pair(x,y),i));
			if(S=="xz")r(i,n)s.insert(P(make_pair(x,i),y));
			if(S=="yz")r(i,n)s.insert(P(make_pair(i,x),y));
		}
		cout<<n*n*n-s.size()<<endl;
	}
}
accuracy: 1
time_ms: 40
memory_kb: 6220
final_rank: 12

code_snippet: #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }

int key(int a, int b, int c) {
	return a * 500 * 500 + b * 500 + c;
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	for (int n, h; cin >> n >> h&&n;) {
		unordered_set<int> st;
		rep(i, 0, h) {
			string c;
			int a, b;
			cin >> c >> a >> b; a--, b--;
			if (c == "xy") {
				rep(j, 0, n)st.insert(key(a, b, j));
			}
			else if (c == "xz") {
				rep(j, 0, n)st.insert(key(a, j, b));
			}
			else {
				rep(j, 0, n)st.insert(key(j, a, b));
			}
		}
		cout << n*n*n - st.size() << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 30
memory_kb: 4996
final_rank: 2

code_snippet: #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iterator>
#include <cctype>
#include <sstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <functional>
#include <ctime>

#pragma comment(linker, "/STACK:102400000, 102400000")
#define debug puts("++++++++++++++++++++++++++++++++++++++++++++++++++++++++")
#define Min(a, b) ( (a < b) ? a : b )
#define Max(a, b) ( (a > b) ? a : b )
#define lc o<<1
#define rc o<<1|1
#define mem0(x) memset(x, 0, sizeof x)
#define mem1(x) memset(x, -1, sizeof x)
#define MAXS 10000 + 8
#define MAXT 10000 + 8
#define MAXL 500000 + 8
#define INF ~0u>>2
#define EPS 1e-20
#define PI acos(-1.0)

using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int maxn = 100000 + 8;

set<int> s;
int n , n1, h, a, b;
char c1, c2;

int ha(int x, int y, int z) {
    return x * n * n + y * n + z;
}

int main() {
   while ( ~scanf("%d%d", &n, &h ) && n + h ) {
        s.clear();
        n1 = n * n * n;
        for (int i = 0;  i < h; i++) {
          getchar();
          scanf("%c%c", &c1, &c2); getchar();
          scanf("%d%d", &a, &b);
          if (c1 == 'x' && c2 == 'y')  for (int i = 1; i <= n; i++) s.insert( ha(a, b, i) );
          else if ( c1 == 'x' && c2 == 'z'  )  for (int i = 1; i <= n; i++) s.insert( ha(a, i, b) );
          else if ( c1 == 'y' && c2 == 'z'  ) for (int i = 1; i <= n; i++) s.insert( ha(i, a, b) );
        }
        printf("%d\n", n1 - s.size() );
   }
   return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 5504
final_rank: 8

code_snippet: #include "bits/stdc++.h"
using namespace std;

int main() {
	while (1) {
		int N, H; cin >> N >> H;
		if (!N&&!H)break;
		set<tuple<int, int, int>>aset;
		for (int i = 0; i < H; ++i) {
			string  st; int  a, b; cin >> st >> a >> b; a--; b--;
			for (int j = 0; j < N; ++j) {
				if (st=="xy") {
					aset.insert(make_tuple(a, b, j));
				}
				else if (st=="xz") {
					aset.insert(make_tuple(a,j,b));
				}
				else {
					aset.insert(make_tuple(j,a,b));
				}
			}
			
		}
		int ans =N*N*N- aset.size();
		cout <<ans << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 6212
final_rank: 11

code_snippet: #include <bits/stdc++.h>

using namespace std;


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, h;
  while(cin >> n >> h && (n || h)){
    int ans = n * n * n;
    set<pair<int, pair<int, int> > > ps;
    for(int i = 0; i < h; i++){
      string str;
      int p[2];
      cin >> str >> p[0] >> p[1];
      for(int j = 1; j <= n; j++){
        if(str == "xy"){
          ps.insert(make_pair(p[0], make_pair(p[1], j)));
        }
        if(str == "xz"){
          ps.insert(make_pair(p[0], make_pair(j, p[1])));
        }
        if(str == "yz"){
          ps.insert(make_pair(j, make_pair(p[0], p[1])));
        }
      }
    }
    ans -= ps.size(); 
    cout << ans << "\n";
  }
  return 0;
}
accuracy: 1
time_ms: 60
memory_kb: 4348
final_rank: 17

code_snippet: #include <bits/stdc++.h>
 
using namespace std;
 
#define MAX 500
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
int main(){
    int N,H,a,b;
    string str;
 
    while(cin >> N >> H, (N | H)){
	set<Q> st;
	for(int i = 0 ; i < H ; i++){
	    cin >> str >> a >> b; a--, b--;
	    if(str == "xy"){
		for(int j = 0 ; j < N ; j++){
		    st.insert(Q(a,P(b,j)));
		}
	    }else if(str == "yz"){
		for(int j = 0 ; j < N ; j++){
		    st.insert(Q(j,P(a,b)));
		}
	    }else{
		for(int j = 0 ; j < N ; j++){
		    st.insert(Q(a,P(j,b)));
		}
	    }
	}
	cout << N*N*N-st.size() << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 6284
final_rank: 14

code_snippet: #include <bits/stdc++.h>
using namespace std;
int n, q, a, b; string s;
int main() {
	while (cin >> n >> q, n | q) {
		set<int> d;
		for (int i = 0; i < q; i++) {
			cin >> s >> a >> b;
			for (int j = 1; j <= n; j++) {
				if (s == "xy") d.insert(a * n * n + b * n + j);
				if (s == "xz") d.insert(a * n * n + j * n + b);
				if (s == "yz") d.insert(j * n * n + a * n + b);
			}
		}
		cout << n * n * n - d.size() << endl;
	}
}
accuracy: 1
time_ms: 40
memory_kb: 5476
final_rank: 7

code_snippet: #include <set>
#include <tuple>
#include <string>
#include <iostream>
using namespace std;
int n, q, a, b; string s;
int main() {
	while (cin >> n >> q, n | q) {
		set<tuple<int, int, int> > d;
		for (int i = 0; i < q; i++) {
			cin >> s >> a >> b;
			for (int j = 1; j <= n; j++) {
				if (s == "xy") d.insert(make_tuple(a, b, j));
				if (s == "xz") d.insert(make_tuple(a, j, b));
				if (s == "yz") d.insert(make_tuple(j, a, b));
			}
		}
		cout << n * n * n - d.size() << endl;
	}
}
accuracy: 1
time_ms: 50
memory_kb: 6264
final_rank: 18

code_snippet: #include<iostream>
#include<string>
#include<vector>
using namespace std;
int xy[600][600], xz[600][600], yz[600][600];
int X[600], Y[600];
int n, q, a, b; string S;
int main() {
	while (true) {
		for (int i = 0; i < 600; i++) {
			X[i] = 0; Y[i] = 0;
			for (int j = 0; j < 600; j++) {
				xy[i][j] = 0; xz[i][j] = 0; yz[i][j] = 0;
			}
		}
		cin >> n >> q; if (n == 0 && q == 0)break;
		for (int i = 0; i < q; i++) {
			cin >> S >> a >> b; a--; b--;
			if (S == "xy") { xy[a][b] = 1; }
			if (S == "xz") { xz[a][b] = 1; }
			if (S == "yz") { yz[a][b] = 1; }
		}
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				X[i] += xy[i][j]; Y[j] += xy[i][j]; cnt += xy[i][j];
			}
		}
		int sum = 0;
		for (int i = 0; i < n; i++) {
			vector<int>XZ, YZ;
			for (int j = 0; j < n; j++) {
				if (xz[j][i] == 1) {
					XZ.push_back(j); sum += n - X[j];
				}
				if (yz[j][i] == 1) {
					YZ.push_back(j); sum += n - Y[j];
				}
			}
			sum += cnt;
			for (int j = 0; j < XZ.size(); j++) {
				for (int k = 0; k < YZ.size(); k++) {
					sum -= (1 - xy[XZ[j]][YZ[k]]);
				}
			}
		}
		cout << n*n*n - sum << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 40
memory_kb: 5452
final_rank: 6

code_snippet: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e9;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int n,h;
	while(cin>>n>>h,n+h){
		set<pair<int,pii> >in;
		while(h--){
			string s;int a,b;
			cin>>s>>a>>b;a--;b--;
			rep(i,n){
				if(s=="xy")in.insert(pair<int,pii>(a,pii(b,i)));
				else if(s=="xz")in.insert(pair<int,pii>(a,pii(i,b)));
				else if(s=="yz")in.insert(pair<int,pii>(i,pii(a,b)));
			}
		}
		cout<<n*n*n-in.size()<<endl;
	}
}
accuracy: 1
time_ms: 60
memory_kb: 4332
final_rank: 15

code_snippet: #include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int n, q, x, y, a[20000000]; string c;
int main() {
	while(cin >> n >> q, n + q) {
		fill(a, a + n * n * n / 32 + 1, 0);
		for(int i = 0; i < q; i++) {
			cin >> c >> x >> y; x--, y--;
			if(c == "xy") {
				for(int j = 0; j < n; j++) {
					int w = x * n * n + y * n + j;
					a[w >> 5] |= (1 << (w & 31));
				}
			}
			if(c == "xz") {
				for(int j = 0; j < n; j++) {
					int w = x * n * n + j * n + y;
					a[w >> 5] |= (1 << (w & 31));
				}
			}
			if(c == "yz") {
				for(int j = 0; j < n; j++) {
					int w = j * n * n + x * n + y;
					a[w >> 5] |= (1 << (w & 31));
				}
			}
		}
		int ret = 0;
		for(int i = 0; i <= n * n * n / 32; i++) ret += __builtin_popcount(a[i]);
		cout << n * n * n - ret << endl;
	}
}
accuracy: 1
time_ms: 130
memory_kb: 18252
final_rank: 19

code_snippet: #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
	int n, h;
	while(cin >> n >> h) {
		if(n == 0 && h == 0) break;

		set<pair<pair<int,int>, int> > st;
		rep(i, h) {
			string s;
			int a, b;
			cin >> s >> a >> b;

			if(s == "xy") {
				rep(i,n) {
					st.insert(mp(mp(a,b),i+1));
				}
			} else if(s == "xz") {
				rep(i,n) {
					st.insert(mp(mp(a,i+1),b));
				}
			} else if(s == "yz") {
				rep(i,n) {
					st.insert(mp(mp(i+1,a),b));
				}
			}
		}

		cout << n * n * n - st.size() << endl;
	}

	return 0;
}
accuracy: 1
time_ms: 50
memory_kb: 4332
final_rank: 9

code_snippet: #include<iostream>
using namespace std;
int main(){
  while(1){  
    int n,h,an;
    cin>>n>>h;
    if(n==0)break;
    an=n*n*n-n*h;
    int xy[501][501]={},yz[501][501]={},xz[501][501]={}; 
    
    for(int i=0;i<h;i++){
      int a,b;
      string c;
      cin>>c>>a>>b;
      if(c=="xy"){
	for(int j=1;j<=n;j++){
	  if(yz[b][j]==1)an++;
	  else if(xz[a][j]==1)an++;
	}
	xy[a][b]=1;
      }
      
      if(c=="yz"){
	for(int j=1;j<=n;j++){
	  if(xy[j][a]==1)an++;
	  else if(xz[j][b]==1)an++;
	}
	yz[a][b]=1;
      }      
      
      if(c=="xz"){
	for(int j=1;j<=n;j++){
	  if(xy[a][j]==1)an++;
	  else if(yz[j][b]==1)an++;
	}	
	xz[a][b]=1;
      }
      
    }
    cout<<an<<endl;
  
  }
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 4160
final_rank: 1

code_snippet: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define INT(a) int((a)+1e-9)
#define mp make_pair

typedef pair<int,pair<int,int> > P;

int main(){
	while(true){
		int N,ql;
		cin >> N >> ql;			if(!N) return 0;
		set<P> ps;
		REP(qi,ql){
			string c; int a,b;
			cin>>c>>a>>b; a--;b--;
			if(c=="xy") REP(z,N) ps.insert(mp(a,mp(b,z)));
			if(c=="xz") REP(y,N) ps.insert(mp(a,mp(y,b)));
			if(c=="yz") REP(x,N) ps.insert(mp(x,mp(a,b)));
		}
		cout<< N*N*N - ps.size() <<endl;
	}
}
accuracy: 1
time_ms: 50
memory_kb: 4332
final_rank: 9

code_snippet: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef pair<int, int> P;
typedef pair< int, P > PP;

int main() {
  int N, H;
  while(cin >>N >>H && N){
    set<PP> S;
    REP(h, H){
      string s; int a, b; cin >>s >>a >>b;
      FOR(i, 1, N + 1){
        if(s == "xy") S.insert(PP(a, P(b, i)));
        if(s == "xz") S.insert(PP(a, P(i, b)));
        if(s == "yz") S.insert(PP(i, P(a, b)));
      }
    }
    cout <<N * N * N - S.size() <<endl;
  }
  return 0;
}
accuracy: 1
time_ms: 60
memory_kb: 4336
final_rank: 16