#include <bits/stdc++.h>
using namespace std;
long long inf = 1e9;
long long power(long long x, long long n, long long mod) {
  long long res = 1;
  x %= mod;
  while (n) {
    if (n & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res % 1000000007;
}
long long dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
bool solve(long long m, long long a[], long long n) {
  for (long long i = 1; i < n; i++) {
    if (a[i] - a[i - 1] > m / 2) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n + 1];
    for (long long i = 1; i <= n; i++) cin >> a[i];
    bool fnd = false;
    for (int i = 1; i + 1 <= n; i++) {
      if (abs(a[i + 1] - a[i]) > 1) {
        cout << "YES" << '\n' << i << " " << i + 1 << '\n';
        fnd = true;
        break;
      }
    }
    if (!fnd) cout << "NO" << '\n';
  }
  return 0;
}
