#include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_genius = 0; ngtkana_is_genius < int(n); ngtkana_is_genius++)
#define rep(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define all(v) v.begin(), v.end()
#define lint long long
auto cmn = [](auto& a, auto b){if (a > b) {a = b; return true;} return false;};
auto cmx = [](auto& a, auto b){if (a < b) {a = b; return true;} return false;};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail){
  std::cerr << " " << head;
  debug_impl(tail...);
}
#define debug(...)\
  std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
  debug_impl(__VA_ARGS__);\
  std::cerr << std::noboolalpha;

template<typename Value, typename BinaryOp>
class segment_tree {
    int                 sz, n, N;
    BinaryOp            op;
    Value               id;
    std::vector<Value>  table;

    auto& op_eq(Value& x, Value y) const { return x = op(x, y); }

    void merge(int u)
      { table.at(u) = op(table.at(2 * u), table.at(2 * u + 1)); }

    Value query_impl(int l, int r, int k, int L, int R) const {
      return l <= L && R <= r
        ? table.at(k)
        : R <= l || r <= L
        ? id
        : op(
          query_impl(l, r, 2 * k, L, (L + R) / 2),
          query_impl(l, r, 2 * k + 1, (L + R) / 2, R)
        );
    }

  public:
    segment_tree(int sz, BinaryOp op, Value id):
      sz    (sz),
      n     (std::pow(2, int(std::log2(2 * sz - 1)))),
      N     (n * 2),
      op    (op),
      id    (id),
      table (N, id)
      {}

    auto& at(int i)       { return table.at(n + i); }

    auto& at(int i) const { return table.at(n + i); }

    auto collect() const {
      auto ret = std::vector<Value>(sz);
      for (auto i = 0; i < sz; i++)
        { ret.at(i) = at(i); }
      return ret;
    }

    auto query(int l, int r) const
      { return query_impl(l, r, 1, 0, n); }

    void build_oneline(int i)
      { for (i += n, i /= 2; i > 0; i /= 2) merge(i); }

    void build()
      { for (auto i = 1; i < n; i++) merge(i); }

    void update (int u, Value val) {
      at(u) = val;
      build_oneline(u);
    }

    void add (int u, Value val) {
      at(u) += val;
      build_oneline(u);
    }
};

template<typename Value, typename BinaryOp>
auto make_segment_tree(int sz, BinaryOp op, Value id)
  { return segment_tree<Value, BinaryOp>(sz, std::move(op), id); }

template <typename T>
std::istream& operator>> (std::istream& is, std::vector<T>& v) {
  for (auto & x : v) is >> x;
  return is;
}

template <typename T>
std::ostream& operator<< (std::ostream& os, const std::vector<T>& v) {
  auto n = v.size();
  os << "{";
  for (size_t i = 0; i < n; i++)
    {os << (i > 0 ? "," : "") << v.at(i);}
  return os << "}";
}

template <typename T, typename U>
std::ostream& operator<< (std::ostream& os, const std::pair<T, U>& pair)
  { return os << "(" << pair.first << "," << pair.second << ")"; }

template <typename T, typename U>
std::istream& operator>> (std::iostream& is, std::pair<T, U>& pair)
  { return is >> pair.first >> pair.second; }

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  int n, q; std::cin >> n >> q;
  auto tree = make_segment_tree(
    n,
    [](auto x, auto y){ return std::make_pair(x.first + y.first, x.second + y.second); },
    std::make_pair(0LL, 0)
  );
  std::vector<std::pair<int, int>> pairs;
  rep(i, 0, n) {
    int x; std::cin >> x;
    pairs.emplace_back(std::make_pair(x, i));
  }
  std::sort(all(pairs));
  std::reverse(all(pairs));
  std::vector<std::tuple<int, int, int, int>> queries;
  rep(i, 0, q) {
    int c, l, r, x;
    std::cin >> c >> l >> r >> x;
    queries.emplace_back(std::make_tuple(x, l, r, i));
  }
  std::sort(all(queries));
  std::reverse(all(queries));
  std::vector<std::pair<int, lint>> answers;
  auto it = pairs.begin();
  for (auto query : queries) {
    int x, l, r, i; std::tie(x, l, r, i) = query;
    l--;
    // debug(x, l, r, i);
    for (; it != pairs.end(); it++) {
      int y, j; std::tie(y, j) = *it;
      if (y <= x) break;
      tree.update(j, std::make_pair(y, 1));
    }
    // debug(tree.collect());
    lint sum, len; std::tie(sum, len) = tree.query(l, r);
    auto ret = sum - len * x;
    answers.emplace_back(i, ret);
  }
  std::sort(all(answers));
  for (auto pair : answers)
    { std::cout << pair.second << std::endl; }
  return 0;
}