On the website of a company that manufactures and sells furniture, customers can order (n) different models of sofas, numbered from (1) to (n). Each sofa has a unique price; the price of the (i)-th sofa is denoted by (a_i). Every customer who visits the website has their own budget (m), which they are willing to spend on a sofa. When they look through the list of sofa models, they search for the first sofa that costs no more than (m) and orders it. If there are no such sofas, then the client leaves the website without ordering anything. The company aims to identify which sofas will never be ordered. Your task is to determine the models such that there is no such budget (m) that a customer will order this particular model. The first line contains a single integer (t) ((1 \le t \le 1000)) — the number of test cases. The first line of each test case contains a single integer (n) ((1 \le n \le 100)). The second line contains (n) distinct integers (a_1, a_2, \dots, a_n) ((1 \le a_i \le 100)). For each test case, provide the answer in this format: on the first line, print a single integer (k) — the number of models that cannot be ordered. On the second line, print exactly (k) integers in ascending order, representing the indices of the models that cannot be ordered.