#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 
const int N = 2e5 + 5; 
const int BLK = 500; 

int n, m, tot, S[N]; 
int a[N], BKA[N], b[N], c[N]; 
int qop[N], qx[N], qy[N]; 
int L[N], R[N], bel[N]; 
i64 ans[N]; 

struct dat {
    i64 m1, m12, m123, m2, m23, m3; 
    dat(i64 m1 = 0, i64 m12 = 0, i64 m123 = 0, i64 m2 = 0, i64 m23 = 0, i64 m3 = 0) : m1(m1), m12(m12), m123(m123), m2(m2), m23(m23), m3(m3) {}
    friend dat operator+ (const dat &a, const dat &b) {
        return dat(a.m1 + b.m1, a.m12 + b.m12 + a.m1 * b.m2, a.m123 + b.m123 + a.m12 * b.m3 + a.m1 * b.m23, a.m2 + b.m2, a.m23 + b.m23 + a.m2 * b.m3, a.m3 + b.m3); 
    }
} C[N], D[N]; 
inline dat makedat(int p, int val) {
    return dat(b[a[p]] == val, 0, 0, a[p] == val, 0, c[a[p]] == val); 
}

vector<int> V, pos[N]; // tmp，每个值对应的位置
inline void getVal(int p) {
    int x = b[a[p]], y = a[p], z = c[a[p]]; 
    V.clear(); V.emplace_back(x); 
    if (y != x) V.emplace_back(y); 
    if (z != x && z != y) V.emplace_back(z); 
}

i64 A[N], B[N]; 
inline void upd1(int x, i64 v) { A[bel[x]] += v; B[x] += v; }
inline i64 query1(int x) {
    i64 r = 0; 
    for (int i = 1; i < bel[x]; ++i) r += A[i]; 
    for (int i = L[bel[x]]; i <= x; ++i) r += B[i]; 
    return r; 
}
void update(int val, int type) {
    dat now, nxt; 
    for (int i : pos[val]) 
        nxt = now + makedat(i, val), 
        upd1(i, type * (nxt.m123 - now.m123)), 
        now = nxt; 
}

inline void upd2(int p, int val) {
    for (int i = L[p]; i <= R[p]; ++i) D[i] = (i == L[p] ? makedat(i, val) : D[i - 1] + makedat(i, val)); 
    for (int i = p; i <= tot; ++i) C[i] = C[i - 1] + D[R[i]]; 
}
inline i64 query2(int x) { return (C[bel[x] - 1] + D[x]).m123; }

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> m; tot = (n - 1) / BLK + 1; 
    for (int i = 1; i <= n; ++i) cin >> a[i], BKA[i] = a[i]; 
    for (int i = 1; i <= n; ++i) cin >> b[i]; 
    for (int i = 1; i <= n; ++i) cin >> c[i]; 

    for (int i = 1; i <= n; ++i) bel[i] = (i - 1) / BLK + 1; 
    for (int i = 1; i <= tot; ++i) L[i] = R[i - 1] + 1, R[i] = min(i * BLK, n); 

    for (int i = 1; i <= n; ++i) {
        getVal(i); 
        for (int x : V) pos[x].emplace_back(i); 
    }
    for (int i = 1; i <= m; ++i) {
        cin >> qop[i] >> qx[i]; 
        if (qop[i] == 1) {
            cin >> qy[i]; a[qx[i]] = qy[i]; getVal(qx[i]); 
            for (int x : V) pos[x].emplace_back(qx[i]); 
        }
    }
    for (int i = 1; i <= n; ++i) a[i] = BKA[i]; 

    for (int i = 1; i <= n; ++i) {
        sort(pos[i].begin(), pos[i].end()); 
        pos[i].erase(unique(pos[i].begin(), pos[i].end()), pos[i].end()); 
        S[i] = pos[i].size(); 
        if (S[i] <= BLK) update(i, 1); 
    }
    for (int i = 1; i <= m; ++i)
        if (qop[i] == 1) {
            getVal(qx[i]); vector<int> W = V; 
            swap(a[qx[i]], qy[i]); getVal(qx[i]); 
            V.insert(V.end(), W.begin(), W.end()); 
            sort(V.begin(), V.end()); 
            V.erase(unique(V.begin(), V.end()), V.end()); 
            for (int x : V) if (S[x] <= BLK) 
                swap(a[qx[i]], qy[i]), update(x, -1), swap(a[qx[i]], qy[i]), update(x, 1); 
            qy[i] = a[qx[i]]; 
        } else ans[i] += query1(qx[i]); 

    for (int val = 1; val <= n; ++val) if (S[val] > BLK) {
        for (int i = 1; i <= n; ++i) a[i] = BKA[i]; 

        for (int i = 1; i <= n; ++i) {
            D[i] = (i == L[bel[i]] ? makedat(i, val) : D[i - 1] + makedat(i, val)); 
            if (i == R[bel[i]]) C[bel[i]] = C[bel[i] - 1] + D[i]; 
        }   
        for (int i = 1; i <= m; ++i)
            if (qop[i] == 1) {
                int x = qx[i], y = qy[i]; 
                int flag = (b[a[x]] == val || a[x] == val || c[a[x]] == val || b[y] == val || y == val || c[y] == val); 
                a[x] = y; 
                if (flag) upd2(bel[x], val); 
            } else ans[i] += query2(qx[i]); 
    }

    for (int i = 1; i <= m; ++i) if (qop[i] == 2) cout << ans[i] << '\n'; 
    return 0; 
}