# Find a Node in Linked List
# Send Feedback
# You have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise.
# Note :
# Assume that the Indexing for the singly linked list always starts from 0.
# Input format :
# The first line contains an Integer 'T' which denotes the number of test cases. 

# The first line of each test case or query contains the elements of the singly linked list separated by a single space. 

# The second line contains the integer value 'N'. It denotes the data to be searched in the given singly linked list.
# Remember/Consider :
# While specifying the list elements for input, -1 indicates the end of the singly linked list and hence -1 would never be a list element.
# Output format :
# For each test case, return the index/position of 'N' in the singly linked list. Return -1, otherwise.

# Output for every test case will be printed in a separate line.
# Note:
# You do not need to print anything; it has already been taken care of. Just implement the given function.
#  Constraints :
# 1 <= T <= 10^2
# 0 <= M <= 10^5

# Where 'M' is the size of the singly linked list.

# Time Limit: 1 sec
# Sample Input 1 :
# 2
# 3 4 5 2 6 1 9 -1
# 5
# 10 20 30 40 50 60 70 -1
# 6
# Sample Output 1 :
# 2
# -1
#  Explanation for Sample Output 1:
# In test case 1, 'N' = 5 appears at position 2 (0-based indexing) in the given linked list.

# In test case 2, we can see that 'N' = 6 is not present in the given linked list.
# Sample Input 2 :
# 2
# 1 -1
# 2
# 3 4 5 2 6 1 9 -1
# 6
# Sample Output 2 :
# -1
# 4
#  Explanation for Sample Output 2:
# In test case 1, we can see that 'N' = 2 is not present in the given linked list.

# In test case 2, 'N' = 6 appears at position 4 (0-based indexing) in the given linked list.

from sys import stdin

#Following is the Node class already written for the Linked List
class Node :
    def __init__(self, data) :
        self.data = data
        self.next = None


def findNode(head, n) :
    count = 0
    value = -1
    while head is not None:
        if head.data == n:
            value = count 
            break
        count = count + 1
        head = head.next
    return value

#Taking Input Using Fast I/O
def takeInput() :
    head = None
    tail = None

    datas = list(map(int, stdin.readline().rstrip().split(" ")))

    i = 0
    while (i < len(datas)) and (datas[i] != -1) :
        data = datas[i]
        newNode = Node(data)

        if head is None :
            head = newNode
            tail = newNode

        else :
            tail.next = newNode
            tail = newNode

        i += 1

    return head


#to print the linked list 
def printLinkedList(head) :

    while head is not None :
        print(head.data, end = " ")
        head = head.next

    print()


#main
t = int(stdin.readline().rstrip())

while t > 0 : 
    
    head = takeInput()
    n = int(stdin.readline().rstrip())
    print(findNode(head, n))

    t -= 1