Problem: Bankopolis, the city you already know, finally got a new bank opened! Unfortunately, its security system is not yet working fine... Meanwhile hacker Leha arrived in Bankopolis and decided to test the system!

Bank has n cells for clients' money. A sequence from n numbers a1, a2, ..., an describes the amount of money each client has. Leha wants to make requests to the database of the bank, finding out the total amount of money on some subsegments of the sequence and changing values of the sequence on some subsegments. Using a bug in the system, Leha can requests two types of queries to the database:

  * 1 l r x y denoting that Leha changes each digit x to digit y in each element of sequence ai, for which l ≤ i ≤ r is holds. For example, if we change in number 11984381 digit 8 to 4, we get 11944341. It's worth noting that Leha, in order to stay in the shadow, never changes digits in the database to 0, i.e. y ≠ 0. 
  * 2 l r denoting that Leha asks to calculate and print the sum of such elements of sequence ai, for which l ≤ i ≤ r holds. 



As Leha is a white-hat hacker, he don't want to test this vulnerability on a real database. You are to write a similar database for Leha to test.

Input

The first line of input contains two integers n and q (1 ≤ n ≤ 105, 1 ≤ q ≤ 105) denoting amount of cells in the bank and total amount of queries respectively. 

The following line contains n integers a1, a2, ..., an (1 ≤ ai < 109) denoting the amount of money in each cell initially. These integers do not contain leading zeros.

Each of the following q lines has one of the formats:

  * 1 l r x y (1 ≤ l ≤ r ≤ n, 0 ≤ x ≤ 9, 1 ≤ y ≤ 9), denoting Leha asks to change each digit x on digit y for each element ai of the sequence for which l ≤ i ≤ r holds; 
  * 2 l r (1 ≤ l ≤ r ≤ n), denoting you have to calculate and print the sum of elements ai for which l ≤ i ≤ r holds. 

Output

For each second type query print a single number denoting the required sum.

Examples

Input

5 5
38 43 4 12 70
1 1 3 4 8
2 2 4
1 4 5 0 8
1 2 5 8 7
2 1 5


Output

103
207


Input

5 5
25 36 39 40 899
1 1 3 2 7
2 1 2
1 3 5 9 1
1 4 4 0 9
2 1 5


Output

111
1002

Note

Let's look at the example testcase.

Initially the sequence is [38, 43, 4, 12, 70]. 

After the first change each digit equal to 4 becomes 8 for each element with index in interval [1; 3]. Thus, the new sequence is [38, 83, 8, 12, 70].

The answer for the first sum's query is the sum in the interval [2; 4], which equal 83 + 8 + 12 = 103, so the answer to this query is 103.

The sequence becomes [38, 83, 8, 12, 78] after the second change and [38, 73, 7, 12, 77] after the third.

The answer for the second sum's query is 38 + 73 + 7 + 12 + 77 = 207.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int a[100001];
long long p10[10];
vector<int> newUpdateVector(10);
vector<long long> s(10);
typedef struct node {
  int leftEnd;
  int rightEnd;
  vector<int> updateVector;
  vector<long long> mulVector;
  long long ans;
  node *leftChild;
  node *rightChild;
} node;
void ResetUpdateVector(vector<int> &updateVector) {
  for (int i = 0; i < 10; i++) updateVector[i] = i;
}
node *CreateNode(int leftEnd, int rightEnd) {
  node *temp = new node;
  temp->leftEnd = leftEnd;
  temp->rightEnd = rightEnd;
  temp->updateVector.resize(10);
  temp->mulVector.resize(10);
  temp->ans = 0;
  ResetUpdateVector(temp->updateVector);
  for (int i = 0; i < 10; i++) temp->mulVector[i] = 0;
  if (leftEnd == rightEnd) {
    int x = a[leftEnd];
    temp->ans = x;
    for (int j = 0; x > 0; x /= 10, j++) {
      int i = x % 10;
      temp->mulVector[i] += p10[j];
    }
  }
  return temp;
}
void Combine(node *currentNode) {
  node *leftChild = currentNode->leftChild,
       *rightChild = currentNode->rightChild;
  for (int i = 0; i < 10; i++)
    currentNode->mulVector[i] =
        leftChild->mulVector[i] + rightChild->mulVector[i];
  currentNode->ans = leftChild->ans + rightChild->ans;
}
node *BuildSegmentTree(int leftEnd, int rightEnd) {
  node *temp = CreateNode(leftEnd, rightEnd);
  if (leftEnd != rightEnd) {
    int mid = (leftEnd + rightEnd) / 2;
    temp->leftChild = BuildSegmentTree(leftEnd, mid);
    temp->rightChild = BuildSegmentTree(mid + 1, rightEnd);
    Combine(temp);
  } else
    temp->leftChild = temp->rightChild = NULL;
  return temp;
}
void ApplyUpdates(node *currentNode, vector<int> &updateVector) {
  currentNode->ans = 0;
  for (int i = 0; i < 10; i++) s[i] = 0;
  for (int i = 0; i < 10; i++) s[updateVector[i]] += currentNode->mulVector[i];
  for (int i = 0; i < 10; i++) {
    currentNode->mulVector[i] = s[i];
    currentNode->ans += i * s[i];
  }
}
void UpdateUpdateVector(vector<int> &updateVector, vector<int> &newUpdates) {
  for (int i = 0; i < 10; i++) updateVector[i] = newUpdates[updateVector[i]];
}
void LazyUpdateChildren(node *currentNode) {
  node *leftChild = currentNode->leftChild,
       *rightChild = currentNode->rightChild;
  UpdateUpdateVector(leftChild->updateVector, currentNode->updateVector);
  UpdateUpdateVector(rightChild->updateVector, currentNode->updateVector);
  ApplyUpdates(leftChild, currentNode->updateVector);
  ApplyUpdates(rightChild, currentNode->updateVector);
  ResetUpdateVector(currentNode->updateVector);
}
void UpdateNode(node *currentNode, int l, int r, int i, int j) {
  if (r < currentNode->leftEnd || currentNode->rightEnd < l) {
    return;
  } else {
    l = max(l, currentNode->leftEnd);
    r = min(r, currentNode->rightEnd);
    if (l == currentNode->leftEnd && r == currentNode->rightEnd) {
      ResetUpdateVector(newUpdateVector);
      newUpdateVector[i] = j;
      ApplyUpdates(currentNode, newUpdateVector);
      UpdateUpdateVector(currentNode->updateVector, newUpdateVector);
    } else {
      LazyUpdateChildren(currentNode);
      UpdateNode(currentNode->leftChild, l, r, i, j);
      UpdateNode(currentNode->rightChild, l, r, i, j);
      Combine(currentNode);
    }
  }
}
long long QueryNode(node *currentNode, int l, int r) {
  long long ans = 0;
  if (r < currentNode->leftEnd || currentNode->rightEnd < l) {
    ans = 0;
  } else {
    l = max(l, currentNode->leftEnd);
    r = min(r, currentNode->rightEnd);
    if (l == currentNode->leftEnd && r == currentNode->rightEnd)
      ans = currentNode->ans;
    else {
      LazyUpdateChildren(currentNode);
      ans = QueryNode(currentNode->leftChild, l, r) +
            QueryNode(currentNode->rightChild, l, r);
      Combine(currentNode);
    }
  }
  return ans;
}
void Initialise() {
  p10[0] = 1;
  for (int i = 1; i < 10; i++) p10[i] = 10 * p10[i - 1];
}
int main() {
  int n, q;
  node *root;
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  Initialise();
  root = BuildSegmentTree(1, n);
  while (q--) {
    int t, l, r;
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1) {
      int i, j;
      scanf("%d%d", &i, &j);
      UpdateNode(root, l, r, i, j);
    } else
      printf("%lld\n", QueryNode(root, l, r));
  }
  return 0;
}