#define pragma

#ifdef pragma
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
#define int long long
#define zero(two) memset(two, 0, sizeof(two))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);
    #if _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const int MAXN = 3e5 + 10;
const int INF = 1e18 + 7;
const int MAXLOG = 20;
const int MOD = 998244353;
const int BASE = 47;
const int MAX = (1ll << 32) - 1;

struct node {
    vi nxt(10), sum(10);
};

void push(int v, int tl, int tr) {
    for(int i = 0; i < 10; i++) {
        t[v * 2 + 1].nxt[i] = t[v].nxt[t[v * 2 + 1].nxt[i]];
        t[v * 2 + 2].nxt[i] = t[v].nxt[t[v * 2 + 2].nxt[i]];
    }
    for(int i = 0; i < 10; i++) {
        t[v].sum[i] = t[v]
    }
}

int get(int v, int tl, int tr, int l, int r) {
    if(tl > r || tr < l) {
        return 0;
    }
    if(tl >= l && tr <= r) {
        int sm = 0;
        for(int i = 0; i < 10; i++) {
            sm += t[v].sum[i] * i;
        }
        return sm;
    }
    int tm = (tl + tr) >> 1;
    int left = get(v * 2 + 1, tl, tm, l, r);
    int right = get(v * 2 + 2, tm + 1, tr, l, r);
    return left + right;
}

void update(int v, int tl, int tr, int l, int r, int x, int y) {
    push(v, tl, tr);
    if(tl > r && tr < l) {
        return;
    }
    if(tl >= l && tr <= r) {
        t[v].nxt[x] = y;
        push(v, tl, tr);
        return;
    }
    int tm = (tl + tr) >> 1;
    update(v * 2 + 1, tl, tm, l, r, x, y);
    update(v * 2 + 2, tm + 1, tr, l ,r ,x, y);
    for(int i = 0; i < 10; i++) {
        t[v].sum[i] = t[v * 2 + 1].sum[i] + t[v * 2 + 2].sum[i];
    }
}

signed main() {
    seriy();
    int n, q;
    cin >> n >> q;
    vi a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    while(q--) {
        int tp;
        cin >> tp;
        if(tp == 1) {
            int l, r, x, y;
            cin >> l >> r >> x >> y;
            l--;
            r--;

        }
        else {
            int l, r;
            cin >> l >> r;
        }
    }
    return 0;
}