using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, q) = (c[0], c[1]);
        var a = NList;
        var query = NArr(q);
        var init = new Info[n];
        for (var i = 0; i < n; ++i) init[i] = new Info(a[i] / 2, a[i] % 2, 1);
        var seg = new LazySegTree<Info, Func>(init, new SegOp());
        var ans = new List<long>();
        for (var i = 0; i < q; ++i)
        {
            var l = query[i][1] - 1;
            var r = query[i][2];
            if (query[i][0] == 1)
            {
                seg.Apply(l, r, new Func(false, true, 0));
            }
            else if (query[i][0] == 2)
            {
                seg.Apply(l, r, new Func(false, false, query[i][3]));
            }
            else
            {
                var sum = seg.Prod(l, r);
                ans.Add(sum.Div * 2 + sum.Mod);
            }
        }
        WriteLine(string.Join("\n", ans));
    }
    struct Info
    {
        public long Div;
        public long Mod;
        public int Len;
        public Info(long div, long mod, int len)
        {
            Div = div; Mod = mod; Len = len;
        }
    }
    struct Func
    {
        public bool AddOneFirst;
        public bool Mod;
        public long AddLast;
        public Func(bool a, bool c, long v)
        {
            AddOneFirst = a; Mod = c; AddLast = v;
        }
    }
    struct SegOp : ILazySegTreeOperator<Info, Func>
    {
        public Info Op(Info a, Info b)
        {
            if (a.Len == 0) return b;
            if (b.Len == 0) return a;
            var msum = a.Mod + b.Mod;
            return new Info(a.Div + b.Div, a.Mod + b.Mod, a.Len + b.Len);
        }
        public Info E() => new Info(0, 0, 0);
        public Func Id() => new Func(false, false, 0);
        public Info Mapping(Func f, Info x)
        {
            if (!f.AddOneFirst && !f.Mod && f.AddLast == 0) return x;
            var d = x.Div;
            var m = x.Mod;
            if (f.AddOneFirst)
            {
                d += m;
                m = x.Len - m;
            }
            if (f.Mod) d = 0;
            if (f.AddLast % 2 == 1)
            {
                d += m;
                m = x.Len - m;
            }
            d += f.AddLast / 2 * x.Len;
            return new Info(d, m, x.Len);
        }
        public Func Composition(Func f, Func g)
        {
            if (!f.AddOneFirst && !f.Mod && f.AddLast == 0) return g;
            if (!g.AddOneFirst && !g.Mod && g.AddLast == 0) return f;
            if (f.Mod)
            {
                var sum = g.AddLast;
                if (g.AddOneFirst) ++sum;
                if (f.AddOneFirst) ++sum;
                sum %= 2;
                return new Func(sum == 1, true, f.AddLast);
            }
            else if (g.Mod)
            {
                var sum = g.AddLast + f.AddLast;
                if (f.AddOneFirst) ++sum;
                return new Func(g.AddOneFirst, g.Mod, sum);
            }
            else
            {
                var sum = g.AddLast + f.AddLast;
                if (g.AddOneFirst) ++sum;
                if (f.AddOneFirst) ++sum;
                return new Func(false, false, sum);
            }
        }
    }
    interface ILazySegTreeOperator<S, F>
    {
        /// <summary>集合S上の二項演算 S×S → S</summary>
        S Op(S a, S b);
        /// <summary>Sの単位元</summary>
        S E();
        /// <summary>写像f(x)</summary>
        S Mapping(F f, S x);
        /// <summary>写像の合成 f ○ g</summary>
        F Composition(F f, F g);
        /// <summary>恒等写像 id</summary>
        F Id();
    }
    // モノイドの型 S
    // 写像の型 F
    // 以下の関数を格納する T
    //   ・: S × S → S を計算する関数 S op(S a, S b)
    //   e を返す関数 S e()
    //   f(x) を返す関数 S mapping(F f, S x)
    //   f○gを返す関数 F composition(F f, F g)
    //   idを返す関数 F id()
    // S,Fはreadonlyにしておくと速い
    // Tの関数オーバーフローに注意
    class LazySegTree<S, F>
    {
        int _n;
        int size;
        int log;
        List<S> d;
        List<F> lz;
        ILazySegTreeOperator<S, F> op;
        public LazySegTree(int n, ILazySegTreeOperator<S, F> op)
        {
            _n = n;
            var v = new S[n];
            for (var i = 0; i < v.Length; ++i) v[i] = op.E();
            Init(v, op);
        }
        public LazySegTree(S[] v, ILazySegTreeOperator<S, F> op)
        {
            _n = v.Length;
            Init(v, op);
        }
        private void Init(S[] v, ILazySegTreeOperator<S, F> op)
        {
            size = 1;
            log = 0;
            this.op = op;
            while (size < v.Length)
            {
                size <<= 1;
                ++log;
            }
            d = Enumerable.Repeat(op.E(), size * 2).ToList();
            lz = Enumerable.Repeat(op. Id(), size).ToList();
            for (var i = 0; i < v.Length; ++i) d[size + i] = v[i];
            for (var i = size - 1; i >= 1; --i) Update(i);
        }

        /// <summary>一点更新</summary>
        public void Set(int pos, S x)
        {
            pos += size;
            for (var i = log; i >= 1; --i) Push(pos >> i);
            d[pos] = x;
            for (var i = 1; i <= log; ++i) Update(pos >> i);
        }

        /// <summary>一点取得</summary>
        public S Get(int pos)
        {
            pos += size;
            for (var i = log; i >= 1; --i) Push(pos >> i);
            return d[pos];
        }

        /// <summary>区間取得 op(a[l..r-1])</summary>
        public S Prod(int l, int r)
        {
            if (l == r) return op.E();
            l += size;
            r += size;
            for (var i = log; i >= 1; --i)
            {
                if (((l >> i) << i) != l) Push(l >> i);
                if (((r >> i) << i) != r) Push(r >> i);
            }
            S sml = op.E();
            S smr = op.E();
            while (l < r)
            {
                if ((l & 1) != 0) sml = op.Op(sml, d[l++]);
                if ((r & 1) != 0) smr = op.Op(d[--r], smr);
                l >>= 1;
                r >>= 1;
            }

            return op.Op(sml, smr);
        }

        /// <summary>全体取得 op(a[0..n-1])</summary>
        public S AllProd() => d[1];

        /// <summary>単体更新 a[p] = op_st(a[p], x)</summary>
        public void Apply(int pos, F f)
        {
            pos += size;
            for (var i = log; i >= 1; --i) Push(pos >> i);
            d[pos] = op.Mapping(f, d[pos]);
            for (var i = 1; i <= log; ++i) Update(pos >> i);
        }

        /// <summary>区間更新 i = l..r-1 について a[i] = op_st(a[i], x)</summary>
        public void Apply(int l, int r, F f)
        {
            if (l == r) return;
            l += size;
            r += size;

            for (var i = log; i >= 1; --i)
            {
                if (((l >> i) << i) != l) Push(l >> i);
                if (((r >> i) << i) != r) Push((r - 1) >> i);
            }
            {
                var l2 = l;
                var r2 = r;
                while (l < r)
                {
                    if ((l & 1) != 0) AllApply(l++, f);
                    if ((r & 1) != 0) AllApply(--r, f);
                    l >>= 1;
                    r >>= 1;
                }
                l = l2;
                r = r2;
            }
            for (var i = 1; i <= log; ++i)
            {
                if (((l >> i) << i) != l) Update(l >> i);
                if (((r >> i) << i) != r) Update((r - 1) >> i);
            }
        }

        /// <summary>segtreeの上で二分探索をする
        /// Sを引数にとりboolを返す関数gが必要
        /// fが単調であれば、g(op(a[l], a[l + 1], ... a[r - 1])) = true となる最大のrが取得される
        /// 制約
        /// ・fに副作用がない
        /// ・f(op.E()) = true
        /// </summary>
        public int MaxRight(int l, Predicate<S> g)
        {
            if (l == _n) return _n;
            if (!g(Get(l))) throw new Exception();
            if (g(Prod(l, _n))) return _n;
            l += size;
            for (var i = log; i >= 1; --i) Push(l >> i);
            S sm = op.E();
            do
            {
                while (l % 2 == 0) l >>= 1;
                if (!g(op.Op(sm, d[l])))
                {
                    while (l < size)
                    {
                        Push(l);
                        l <<= 1;
                        if (g(op.Op(sm, d[l])))
                        {
                            sm = op.Op(sm, d[l]);
                            ++l;
                        }
                    }
                    return l - size;
                }
                sm = op.Op(sm, d[l]);
                ++l;
            } while ((l & -l) != l);
            return _n;
        }

        /// <summary>segtreeの上で二分探索をする
        /// Sを引数にとりboolを返す関数gが必要
        /// fが単調であれば、g(op(a[l], a[l + 1], ..., a[r - 1])) = true となる最小のlが取得される
        /// 制約
        /// ・fに副作用がない
        /// f(op.E()) = true
        public int MinLeft(int r, Predicate<S> g)
        {
            if (r == 0) return 0;
            r += size;
            for (var i = log; i >= 1; --i) Push((r - 1) >> i);
            S sm = op.E();
            do
            {
                --r;
                while (r > 1 && r % 2 == 1) r >>= 1;
                if (!g(op.Op(d[r], sm)))
                {
                    while (r < size)
                    {
                        Push(r);
                        r = 2 * r + 1;
                        if (g(op.Op(d[r], sm)))
                        {
                            sm = op.Op(d[r], sm);
                            --r;
                        }
                    }
                    return r + 1 - size;
                }
                sm = op.Op(d[r], sm);
            } while ((r & -r) != r);
            return 0;
        }
        void Update(int k)
        {
            d[k] = op.Op(d[2 * k], d[2 * k + 1]);
        }
        void AllApply(int k, F f)
        {
            d[k] = op.Mapping(f, d[k]);
            if (k < size) lz[k] = op.Composition(f, lz[k]);
        }
        void Push(int k)
        {
            AllApply(2 * k, lz[k]);
            AllApply(2 * k + 1, lz[k]);
            lz[k] = op.Id();
        }
    }
}