import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int q = sc.nextInt();
        BinaryIndexedTree values = new BinaryIndexedTree(n + 2);
        for (int i = 1; i <= n; i++) {
            int x = sc.nextInt();
            values.add(i, x);
            values.add(i + 1, -x);
        }
        BinaryIndexedTree counts = new BinaryIndexedTree(n + 1);
        for (int i = 1; i < n; i++) {
            if (values.getSum(i) != values.getSum(i + 1)) {
                counts.add(i, 1);
            }
        }
        StringBuilder sb = new StringBuilder();
        while (q-- > 0) {
            if (sc.nextInt() == 1) {
                int left = sc.nextInt();
                int right = sc.nextInt();
                int x = sc.nextInt();
                if (left > 1) {
                    long lPrevMinus = values.getSum(left - 1);
                    long lPrev = values.getSum(left);
                    if (lPrevMinus == lPrev) {
                        counts.add(left - 1, 1);
                    } else if (lPrevMinus - lPrev == x) {
                        counts.add(left - 1, -1);
                    }
                }
                if (right < n) {
                    long rPrev = values.getSum(right);
                    long rPrevPlus = values.getSum(right + 1);
                    if (rPrev == rPrevPlus) {
                        counts.add(right, 1);
                    } else if (rPrevPlus - rPrev == x) {
                        counts.add(right, -1);
                    }
                }
                values.add(left, x);
                values.add(right + 1, -x);
            } else {
                int left = sc.nextInt();
                int right = sc.nextInt();
                sb.append(counts.getSum(left, right - 1) + 1).append("\n");
            }
        }
        System.out.print(sb);
    }
    
}
class BinaryIndexedTree {
    int size;
    long[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new long[size];
    }
    
    public void add(int idx, long value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public long getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public long getSum(int x) {
        int mask = 1;
        long ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}