#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
pii solve(const vector<ll>& a) {
  int n = a.size();
  vector<ll> b(n);
  ll minb = 1e18;
  int minbi = -1;
  for (int i = 0; i < n; ++i) {
    b[i] = a[i] - i;
    if (i > 0 and minb < b[i]) {
      return {minbi, i};
    }
    if (b[i] <= minb) {
      minb = b[i];
      minbi = i;
    }
  }
  return {-1, -1};
}
void solve() {
  int n;
  cin >> n;
  vector<ll> a(n);
  for (auto& x : a) {
    cin >> x;
  }
  for (int k = 0; k < 2; ++k) {
    pii p = solve(a);
    if (p.first != -1) {
      cout << "YES\n";
      cout << p.first + 1 << ' ' << p.second + 1 << '\n';
      return;
    }
    for (auto& x : a) {
      x = -x;
    }
  }
  cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T-- > 0) {
    solve();
  }
  return 0;
}
