#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: sparseTable
 * author: Misuki
 * last update: 2023/11/30
 * verify: LibraryChecker - Static RMQ
 */

template<class T>
struct sparseTable{
  vector<vector<T> > table;
  function<T(T, T)> comb;
  int size = 0;

  sparseTable(vector<T> &base, function<T(T, T)> _comb) {
    comb = _comb;
    size = base.size();
    table.resize(bit_width((unsigned)size), std::vector<T>(size));
    
    table[0] = base;
    for(int i = 1; i < ssize(table); i++) {
      for(int j = 0; j < size; j++) {
        if (j + (1 << (i - 1)) < size)
          table[i][j] = comb(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
        else
          table[i][j] = table[i - 1][j];
      }
    }
  }

  //query range in [l, r)
  T query(int l, int r) {
    int range = bit_width((unsigned)(r - l)) - 1;
    return comb(table[range][l], table[range][r - (1 << range)]);
  }
};

struct M {
  int orSum, hb;
  array<int, 30> rb;
  M(unsigned x = 0) : orSum(x), hb(bit_width(x) - 1) {
    fill(rb.begin(), rb.end(), -1);
    for(int bit = 0, p = 0; bit < 30; bit++) {
      if (x >> bit & 1) {
        for(int i = p; i <= bit; i++)
          rb[i] = bit;
        p = bit + 1;
      }
    }
  }
};

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;

    vector<M> init(n);
    for(int i = 0; i < n; i++) 
      init[i] = M(a[i]);

    sparseTable<M> st(init, [](M l, M r) {
      M res;
      res.orSum = l.orSum | r.orSum, res.hb = max(l.hb, r.hb);
      for(int i = 0; i < 30; i++)
        res.rb[i] = max(l.rb[i], r.rb[i]);
      return res;
    });

    while(q--) {
      int l, r; cin >> l >> r;
      M res = st.query(l - 1, r);
      int ans = (1 << (res.hb + 1)) - 1, ope;
      if (res.orSum == ans) {
        ope = 0;
      } else {
        int d = 30, u = -1;
        for(int bit = 0; bit < res.hb; bit++)
          if (~res.orSum >> bit & 1)
            d = min(d, bit), u = bit;

        if (res.rb[d] >= u)
          ope = 1;
        else
          ope = 2;
      }
      cout << ans << ' ' << ope << '\n';
    }
  }

  return 0;
}