#include <bits/stdc++.h>
using namespace std;
int ls[500005 * 30], rs[500005 * 30], rt[10], n, Q, x, y, l, r, opt;
long long d[500005 * 30];
int tmp[10], cnt;
int merge(int x, int y) {
  if (!x || !y) return x + y;
  d[x] += d[y];
  ls[x] = merge(ls[x], ls[y]);
  rs[x] = merge(rs[x], rs[y]);
  return x;
}
void insert(int &k, int l, int r, int x, int y) {
  if (!k) k = ++cnt;
  d[k] += y;
  if (l == r) return;
  int mid = (l + r) >> 1;
  if (x <= mid)
    insert(ls[k], l, mid, x, y);
  else
    insert(rs[k], mid + 1, r, x, y);
}
void change(int &k, int &k1, int l, int r, int x, int y) {
  if (!k) return;
  if (x <= l && y >= r) {
    k1 = merge(k1, k);
    k = 0;
    return;
  }
  int mid = (l + r) >> 1;
  if (!k1) k1 = ++cnt;
  if (y <= mid)
    change(ls[k], ls[k1], l, mid, x, y);
  else if (x > mid)
    change(rs[k], rs[k1], mid + 1, r, x, y);
  else
    change(ls[k], ls[k1], l, mid, x, mid),
        change(rs[k], rs[k1], mid + 1, r, mid + 1, y);
  d[k] = d[ls[k]] + d[rs[k]];
  d[k1] = d[ls[k1]] + d[rs[k1]];
}
long long query(int k, int l, int r, int x, int y) {
  if (!k) return 0;
  if (x <= l && y >= r) return d[k];
  int mid = (l + r) >> 1;
  if (y <= mid)
    return query(ls[k], l, mid, x, y);
  else if (x > mid)
    return query(rs[k], mid + 1, r, x, y);
  else
    return query(ls[k], l, mid, x, mid) + query(rs[k], mid + 1, r, mid + 1, y);
}
int main() {
  scanf("%d%d", &n, &Q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    int tmp1 = 1;
    while (x) {
      tmp[x % 10] += tmp1;
      tmp1 *= 10;
      x /= 10;
    }
    for (int j = 0; j < 10; j++) insert(rt[j], 1, n, i, tmp[j]), tmp[j] = 0;
  }
  while (Q--) {
    scanf("%d%d%d", &opt, &l, &r);
    if (opt == 1) {
      scanf("%d%d", &x, &y);
      if (x == y) continue;
      change(rt[x], rt[y], 1, n, l, r);
    } else {
      long long ans = 0;
      for (int i = 1; i <= 9; i++)
        ans = ans + 1ll * i * query(rt[i], 1, n, l, r);
      printf("%lld\n", ans);
    }
  }
  return 0;
}
