import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author prakharjain
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        _1053C solver = new _1053C();
        solver.solve(1, in, out);
        out.close();
    }

    static class _1053C {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();

            int q = in.nextInt();

            int[] a = new int[n];

            long[] w = new long[n];

            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < n; i++) {
                w[i] = in.nextInt();
            }

//        long[] pre = new long[n];
//        long[] suf = new long[n];
//
//        pre[0] = w[0];
//
//        for (int i = 1; i < n; i++) {
//            pre[i] = w[i] + pre[i - 1];
//        }
//
//        suf[n - 1] = w[n - 1];
//
//        for (int i = n - 2; i >= 0; i--) {
//            suf[i] = suf[i + 1] + w[i];
//        }

            long[] preg = new long[n];

            for (int i = 1; i < n; i++) {
                preg[i] = preg[i - 1] + a[i] - a[i - 1] - 1;
            }

            long[] sufg = new long[n];

            for (int i = n - 2; i >= 0; i--) {
                sufg[i] = sufg[i + 1] + a[i + 1] - a[i] - 1;
            }

            long[] pregw = new long[n];

            for (int i = 0; i < n; i++) {
                pregw[i] = preg[i] * w[i];
            }

            long[] sufgw = new long[n];

            for (int i = 0; i < n; i++) {
                sufgw[i] = sufg[i] * w[i];
            }

            SegmentTree pst = new SegmentTree(n);

            pst.build(0, pregw, 0, n - 1);

            SegmentTree sst = new SegmentTree(n);

            sst.build(0, sufgw, 0, n - 1);

            SegmentTree wst = new SegmentTree(n);

            wst.build(0, w, 0, n - 1);


            while (q-- > 0) {
                int x = in.nextInt();
                int y = in.nextInt();

                if (x < 0) {
                    x = -x;
                    wst.update(0, 0, n - 1, x - 1, y);

                    pst.update(0, 0, n - 1, x - 1, preg[x - 1] * y);

                    sst.update(0, 0, n - 1, x - 1, sufg[x - 1] * y);
                } else {
                    x--;
                    y--;

                    long ts = wst.query(0, 0, n - 1, x, y);

                    int lo = x;
                    int hi = y;

                    int li = hi;
                    while (lo <= hi) {
                        int mid = (lo + hi) / 2;

                        long cs = wst.query(0, 0, n - 1, x, mid);

                        if (cs >= (ts + 1) / 2) {
                            li = Math.min(li, mid);
                            hi = mid - 1;
                        } else {
                            lo = mid + 1;
                        }
                    }

                    long bg = preg[li];

                    long fsum = pst.query(0, 0, n - 1, li, y);
                    fsum -= bg * wst.query(0, 0, n - 1, li, y);

                    long bsum = 0;
                    if (li > x) {
                        bsum = sst.query(0, 0, n - 1, x, li - 1);
                        bsum -= sufg[li] * wst.query(0, 0, n - 1, x, li - 1);
                    }

                    out.println(fsum + bsum);
                }
            }

        }

        class SegmentTree {
            long[] st;
            int n;

            public SegmentTree(int n) {
                st = new long[4 * n];
                this.n = n;
            }

            void build(int i, long[] a, int r1, int r2) {
                if (r1 == r2) {
                    st[i] = a[r1];
                } else {
                    build(i * 2 + 1, a, r1, (r1 + r2) / 2);
                    build(i * 2 + 2, a, (r1 + r2) / 2 + 1, r2);

                    st[i] = st[i * 2 + 1] + st[i * 2 + 2];
                }
            }

            long query(int i, int ra, int rb, int r1, int r2) {
                if (ra > r2 || rb < r1) {
                    return 0;
                }

                if (ra >= r1 && rb <= r2) {
                    return st[i];
                }

                long p1 = query(i * 2 + 1, ra, (ra + rb) / 2, r1, r2);
                long p2 = query(i * 2 + 2, (ra + rb) / 2 + 1, rb, r1, r2);

                return p1 + p2;
            }

            long update(int i, int ra, int rb, int ind, long val) {
                if (ra == rb && rb == ind) {
                    st[i] = val;
                    return st[i];
                }

                if (ra > ind || rb < ind) {
                    return st[i];
                }

                long p1 = update(i * 2 + 1, ra, (ra + rb) / 2, ind, val);
                long p2 = update(i * 2 + 2, (ra + rb) / 2 + 1, rb, ind, val);

                return st[i] = p1 + p2;
            }

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(long i) {
            writer.println(i);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

