#include <bits/stdc++.h>
using namespace std;
inline int min(int a, int b) { return a > b ? b : a; }
inline int max(int a, int b) { return a > b ? a : b; }
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
long long solve(long long n, vector<long long> a) {
  long long sum = 0;
  for (long long i = 0; i < a.size(); i++) {
    sum += a[i];
  }
  if (sum < n) return -1;
  vector<int> pows(61, 0);
  for (long long i = 0; i < a.size(); i++) {
    pows[(int)log2(a[i])]++;
  }
  int i = 0;
  int cnt = 0;
  int mysum = 0;
  while (i < 60) {
    if ((1ll << i) & n) {
      if (pows[i] > 0) {
        pows[i]--;
        mysum += (1ll << i);
      } else {
        mysum += (1ll << i);
        while (i < 60 && pows[i] == 0) {
          i++;
          cnt++;
        }
        pows[i]--;
        continue;
      }
    }
    pows[i + 1] += pows[i] / 2;
    i++;
  }
  return cnt;
}
void checker(vector<int>& a) {
  for (int i = 0; i < a.size() - 1; i++) {
    if (abs(a[i] - a[i + 1]) >= 2) {
      cout << "YES\n";
      cout << i + 1 << " " << i + 2 << "\n";
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  int t;
  cin >> t;
  for (long long i = 0; i < t; i++) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (long long j = 0; j < n; j++) cin >> a[j];
    checker(a);
  }
  return 0;
}
