#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
namespace fastinput {
template <class T = int>
inline T readInt();
inline long double readDouble();
inline int readUInt();
inline int readChar();
inline void readWord(char *s);
inline bool readLine(char *s);
inline bool isEof();
inline int peekChar();
inline bool seekEof();
template <class T>
inline void writeInt(T x);
template <class T>
inline void writeUInt(T x, int len = -1);
inline void writeChar(int x);
inline void writeWord(const char *s);
inline void writeDouble(long double x, int len = 0);
inline void flush();
static const int buf_size = 4096;
static char buf[buf_size];
static int buf_len = 0, buf_pos = 0;
inline bool isEof() {
  if (buf_pos == buf_len) {
    buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin);
    if (buf_pos == buf_len) return 1;
  }
  return 0;
}
inline int getChar() { return isEof() ? -1 : buf[buf_pos++]; }
inline int peekChar() { return isEof() ? -1 : buf[buf_pos]; }
inline bool seekEof() {
  int c;
  while ((c = peekChar()) != -1 && c <= 32) buf_pos++;
  return c == -1;
}
inline int readChar() {
  int c = getChar();
  while (c != -1 && c <= 32) c = getChar();
  return c;
}
inline int readUInt() {
  int c = readChar(), x = 0;
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return x;
}
template <class T>
inline T readInt() {
  int s = 1, c = readChar();
  T x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return s == 1 ? x : -x;
}
inline long double readDouble() {
  int s = 1, c = readChar();
  long double x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  if (c == '.') {
    c = getChar();
    long double coef = 1;
    while ('0' <= c && c <= '9') x += (c - '0') * (coef *= 0.1), c = getChar();
  }
  return s == 1 ? x : -x;
}
inline void readWord(char *s) {
  int c = readChar();
  while (c > 32) *s++ = (char)c, c = getChar();
  *s = 0;
}
inline bool readLine(char *s) {
  int c = getChar();
  while (c != '\n' && c != -1) *s++ = (char)c, c = getChar();
  *s = 0;
  return c != -1;
}
static int write_buf_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
  if (write_buf_pos == buf_size)
    fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0;
  write_buf[write_buf_pos++] = (char)x;
}
inline void flush() {
  if (write_buf_pos)
    fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0;
}
template <class T>
inline void writeInt(T x) {
  if (x < 0) writeChar('-'), x = -x;
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = '0' + x % 10, x /= 10;
  while (n--) writeChar(s[n]);
}
template <class T>
inline void writeUInt(T x, int output_len) {
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = (char)('0' + (char)(x % 10)), x /= 10;
  while (n < output_len) s[n++] = '0';
  while (n--) writeChar(s[n]);
}
inline void writeWord(const char *s) {
  while (*s) writeChar(*s++);
}
inline void writeDouble(long double x, int output_len) {
  if (x < 0) writeChar('-'), x = -x;
  int t = (int)x;
  writeUInt(t), x -= t;
  writeChar('.');
  for (int i = output_len - 1; i > 0; i--) {
    x *= 10;
    t = std::min(9, (int)x);
    writeChar('0' + t), x -= t;
  }
  x *= 10;
  t = std::min(9, (int)(x + 0.5));
  writeChar('0' + t);
}
}  // namespace fastinput
using namespace fastinput;
using namespace std;
const int N = 2e5 + 10;
int a[N];
int *t[4 * N];
const int MAX_MEM = 2e8;
int mpos = 0;
char mem[MAX_MEM];
inline void *operator new(size_t n) {
  mpos += n;
  return (void *)(mem + mpos - n);
}
inline void operator delete(void *) noexcept {}
int A, B, X;
void build(int i, int l, int r) {
  if (l == r) {
    t[i] = (int *)malloc(sizeof(int));
    t[i][0] = a[l];
  } else {
    int mid = (l + r) / 2;
    build(2 * i, l, mid);
    build(2 * i + 1, mid + 1, r);
    t[i] = (int *)malloc((r - l + 1) << 2);
    merge(t[2 * i], t[2 * i] + mid - l + 1, t[2 * i + 1],
          t[2 * i + 1] + r - mid, t[i]);
  }
}
int query(int i, int l, int r) {
  if (l > B || r < A) return 0;
  if (l >= A && r <= B) {
    return lower_bound(t[i], t[i] + r - l + 1, X) - t[i];
  }
  return query(2 * i, l, (l + r) / 2) + query(2 * i + 1, (l + r) / 2 + 1, r);
}
int n;
int ask(int x, int y) {
  A = 1;
  B = x - 1;
  X = y;
  return query(1, 1, n);
}
long long answer[N];
void ans(const int x1, const int y1, const int x2, const int y2, const int id) {
  const long long ld = ask(x1, y1);
  const long long lm = ask(x1, y2) - ld;
  const long long lu = ask(x1, n + 1) - lm - ld;
  const long long md = ask(x2, y1) - ld;
  const long long mm = ask(x2, y2) - lm - md - ld;
  const long long mu = ask(x2, n + 1) - ld - lm - lu - md - mm;
  const long long rd = ask(n + 1, y1) - ld - md;
  const long long rm = ask(n + 1, y2) - ld - md - rd - lm - mm;
  const long long ru =
      ask(n + 1, n + 1) - ld - lm - lu - md - mm - mu - rd - rm;
  ::answer[id] += ld * (mm + mu + rm + ru);
  ::answer[id] += lm * (md + mm + mu + rd + rm + ru);
  ::answer[id] += lu * (mm + md + rm + rd);
  ::answer[id] += md * (mm + rm + ru);
  ::answer[id] += mm * (rd + rm + ru);
  ::answer[id] += (mm * (mm - 1)) / 2;
  ::answer[id] += mu * (mm + rm + rd);
  ::answer[id] += md * mu;
}
int main() {
  ::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  n = readInt();
  int q = readInt();
  for (int i = 1; i <= n; ++i) {
    a[i] = readInt();
  }
  build(1, 1, n);
  for (int i = 0; i < q; ++i) {
    int x1 = readInt(), y1 = readInt(), x2 = readInt(), y2 = readInt();
    ++x2, ++y2;
    ans(x1, y1, x2, y2, i);
  }
  for (int i = 0; i < q; ++i) {
    writeInt(answer[i]);
    writeChar('\n');
  }
  flush();
  return 0;
}
