Problem: You are given an array a consisting of n integers.

Let min(l, r) be the minimum value among a_l, a_{l + 1}, …, a_r and max(l, r) be the maximum value among a_l, a_{l + 1}, …, a_r.

Your task is to choose three positive (greater than 0) integers x, y and z such that:

  * x + y + z = n; 
  * max(1, x) = min(x + 1, x + y) = max(x + y + 1, n). 



In other words, you have to split the array a into three consecutive non-empty parts that cover the whole array and the maximum in the first part equals the minimum in the second part and equals the maximum in the third part (or determine it is impossible to find such a partition).

Among all such triples (partitions), you can choose any.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (3 ≤ n ≤ 2 ⋅ 10^5) — the length of a.

The second line of the test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9), where a_i is the i-th element of a.

It is guaranteed that the sum of n does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5).

Output

For each test case, print the answer: NO in the only line if there is no such partition of a that satisfies the conditions from the problem statement. Otherwise, print YES in the first line and three integers x, y and z (x + y + z = n) in the second line.

If there are several answers, you can print any.

Example

Input


6
11
1 2 3 3 3 4 4 3 4 2 1
8
2 9 1 7 3 9 4 1
9
2 1 4 2 4 3 3 1 2
7
4 2 1 1 4 1 4
5
1 1 1 1 1
7
4 3 4 3 3 3 4


Output


YES
6 1 4
NO
YES
2 5 2
YES
4 1 2
YES
1 1 3
YES
2 1 4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Problem_F {
	static class SegmentTree {
		int n;
		int[] t;

		SegmentTree(int[] d) {
			n = d.length;
			int h = (int)Math.ceil(Math.log(n) / Math.log(2));
			t = new int[1 << (h + 1)];
			init(d, 1, 0, n - 1);
		}

		int init(int[] d, int n, int s, int e) {
			if (s == e) {
				return t[n] = d[s];
			} else {
				return t[n] = Math.max(init(d, 2 * n, s, (s + e) / 2), init(d, 2 * n + 1, (s + e) / 2 + 1, e));
			}
		}

		int max(int l, int r) {
			return max(1, 0, n - 1, l, r);
		}

		int max(int n, int s, int e, int l, int r) {
			if (r < s || e < l) {
				return Integer.MIN_VALUE;
			} else if (l <= s && e <= r) {
				return t[n];
			} else {
				return Math.max(max(2 * n, s, (s + e) / 2, l, r), max(2 * n + 1, (s + e) / 2 + 1, e, l, r));
			}
		}
	}

	static class Pair implements Comparable<Pair> {
		int x, y;

		Pair(int x, int y) {
			this.x = x;
			this.y = y;
		}

		public int compareTo(Pair p) {
			return x == p.x ? y - p.y : x - p.x;
		}
	}

	public static void main(String[] args) {
		InputReader in = new InputReader();
		StringBuilder out = new StringBuilder();

		int T = in.nextInt();
		xx: while (T-- > 0) {
			int N = in.nextInt();
			int[] A = new int[N];
			for (int i = 0; i < N; i++) {
				A[i] = in.nextInt();
			}
			Pair[] p = new Pair[N];
			for (int i = 0; i < N; i++) {
				p[i] = new Pair(A[i], i);
			}
			TreeSet<Pair> set = new TreeSet<>();
			for (int i = 1; i < N - 1; i++) {
				set.add(p[i]);
			}
			SegmentTree seg = new SegmentTree(A);
			int l = 0;
			int r = N - 1;
			int max_l = A[0];
			int max_r = A[N - 1];
			while (l < r - 1) {
				if (max_l == max_r && max_l == set.first().x) {
					out.append("YES\n");
					out.append(l + 1).append(' ');
					out.append(r - l - 1).append(' ');
					out.append(N - r).append('\n');
					continue xx;
				}
				if (max_l == max_r) {
					if (max_l > A[l + 1] || max_r < A[r - 1]) {
						max_l = Math.max(max_l, A[++l]);
						set.remove(p[l]);
					} else if (max_r > A[r - 1] || max_l < A[l + 1]) {
						max_r = Math.max(max_r, A[--r]);
						set.remove(p[r]);
					} else if (seg.max(l + 1, set.first().y) == max_l) {
						max_l = Math.max(max_l, A[++l]);
						set.remove(p[l]);
					} else {
						max_r = Math.max(max_r, A[--r]);
						set.remove(p[r]);
					}
				} else if (max_l < max_r) {
					max_l = Math.max(max_l, A[++l]);
					set.remove(p[l]);
				} else {
					max_r = Math.max(max_r, A[--r]);
					set.remove(p[r]);
				}
			}
			out.append("NO\n");
		}

		System.out.print(out);
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer st;

		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(nextLine());
			}
			return st.nextToken();
		}

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return null;
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
}