#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using tiii = tuple<int, int, int>;
using ldb = long double;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}

/**
 * template name: segmentTree
 * author: Misuki
 * last update: 2023/11/30
 * verify: library checker - Point Add Range Sum, Static RMQ
 */

template<class T>
struct segmentTree {
  function<T(const T&, const T&)> combine;
  T UNIT;
  vector<T> arr;
  int sz;

  segmentTree(int _sz, T _UNIT, function<T(const T&, const T&)> _combine) {
    sz = _sz;
    UNIT = _UNIT;
    combine = _combine;
    arr.resize(2 * sz, UNIT);
  }

  void set(int idx, T val) {
    idx += sz;
    arr[idx] = val;
    idx >>= 1;
    while(idx) {
      arr[idx] = combine(arr[idx<<1], arr[idx<<1|1]); 
      idx >>= 1;
    }
  }

  T get(int idx) {
    return arr[idx + sz];
  }

  T query(int l, int r) {
    T L = UNIT, R = UNIT;
    for(l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
      if (l & 1) L = combine(L, arr[l++]);
      if (r & 1) R = combine(arr[--r], R);
    }
    return combine(L, R);
  }
};

using state = array<int, 32>;

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int t; cin >> t;
  while(t--) {
    int n, q; cin >> n >> q;
    vector<int> a(n);
    for(int &x : a)
      cin >> x;

    segmentTree<state> seg(n, state{}, [](const state &l, const state &r) {
      state res;
      for(int i = 0; i < 32; i++)
        res[i] = l[i] | r[i];
      return res;
    });

    for(int i = 0; i < n; i++) {
      state tmp = {};
      tmp[31] = a[i];
      for(int bit = 0, p = 0; bit < 30; bit++) {
        if (a[i] >> bit & 1) {
          for(int j = p; j <= bit; j++)
            tmp[j] = (1 << (bit + 1)) - (1 << p);
          p = bit + 1;
        }
      }
      seg.set(i, tmp);
    }

    while(q--) {
      int l, r; cin >> l >> r;
      state res = seg.query(l - 1, r);
      int ans = (1 << bit_width((unsigned)res[31])) - 1, ope;
      if (res[31] == ans)
        ope = 0;
      else if (*max_element(res.begin(), res.begin() + 30) == ans)
        ope = 1;
      else
        ope = 2;
      cout << ans << ' ' << ope << '\n';
    }
  }

  return 0;
}