You are given a graph with $3 \cdot n$ vertices and $m$ edges. You are to find a matching of $n$ edges, or an independent set of $n$ vertices.

A set of edges is called a matching if no two edges share an endpoint.

A set of vertices is called an independent set if no two vertices are connected with an edge.


-----Input-----

The first line contains a single integer $T \ge 1$ — the number of graphs you need to process. The description of $T$ graphs follows.

The first line of description of a single graph contains two integers $n$ and $m$, where $3 \cdot n$ is the number of vertices, and $m$ is the number of edges in the graph ($1 \leq n \leq 10^{5}$, $0 \leq m \leq 5 \cdot 10^{5}$).

Each of the next $m$ lines contains two integers $v_i$ and $u_i$ ($1 \leq v_i, u_i \leq 3 \cdot n$), meaning that there is an edge between vertices $v_i$ and $u_i$.

It is guaranteed that there are no self-loops and no multiple edges in the graph.

It is guaranteed that the sum of all $n$ over all graphs in a single test does not exceed $10^{5}$, and the sum of all $m$ over all graphs in a single test does not exceed $5 \cdot 10^{5}$.


-----Output-----

Print your answer for each of the $T$ graphs. Output your answer for a single graph in the following format.

If you found a matching of size $n$, on the first line print "Matching" (without quotes), and on the second line print $n$ integers — the indices of the edges in the matching. The edges are numbered from $1$ to $m$ in the input order.

If you found an independent set of size $n$, on the first line print "IndSet" (without quotes), and on the second line print $n$ integers — the indices of the vertices in the independent set.

If there is no matching and no independent set of the specified size, print "Impossible" (without quotes).

You can print edges and vertices in any order.

If there are several solutions, print any. In particular, if there are both a matching of size $n$, and an independent set of size $n$, then you should print exactly one of such matchings or exactly one of such independent sets.


-----Example-----
Input
4
1 2
1 3
1 2
1 2
1 3
1 2
2 5
1 2
3 1
1 4
5 1
1 6
2 15
1 2
1 3
1 4
1 5
1 6
2 3
2 4
2 5
2 6
3 4
3 5
3 6
4 5
4 6
5 6

Output
Matching
2
IndSet
1
IndSet
2 4
Matching
1 15



-----Note-----

The first two graphs are same, and there are both a matching of size 1 and an independent set of size 1. Any of these matchings and independent sets is a correct answer.

The third graph does not have a matching of size 2, however, there is an independent set of size 2. Moreover, there is an independent set of size 5: 2 3 4 5 6. However such answer is not correct, because you are asked to find an independent set (or matching) of size exactly $n$.

The fourth graph does not have an independent set of size 2, but there is a matching of size 2.

Difficulty: competition

Starter code:

Solutions:
import sys
input = sys.stdin.readline

T = int(input())
for _ in range(T):
    N, M = list(map(int, input().split()))
    X = [[] for i in range(3*N)]
    for i in range(M):
        x, y = list(map(int, input().split()))
        x, y = min(x,y), max(x,y)
        X[x-1].append((y-1, i+1))
    
    MAT = []
    IND = []
    DONE = [0] * 3*N
    for i in range(3*N):
        if DONE[i]: continue
        for j, ind in X[i]:
            if DONE[j] == 0:
                MAT.append(ind)
                DONE[i] = 1
                DONE[j] = 1
                break
        else:
            IND.append(i+1)

    if len(MAT) >= N:
        print("Matching")
        print(*MAT[:N])
    else:
        print("IndSet")
        print(*IND[:N])




import sys
input=sys.stdin.readline
T=int(input())
for _ in range(T):
    n,m=map(int,input().split())
    edges=[0]*m
    for i in range(m):
        edges[i]=tuple(map(int,input().split()))
    used=[0]*(3*n)
    edgess=[]
    check=0
    for i in range(m):
        if used[edges[i][0]-1]==used[edges[i][1]-1]==0:
            edgess.append(i+1)
            used[edges[i][0]-1]=1
            used[edges[i][1]-1]=1
            check+=1
    if check>=n:
        useful=edgess[:n]
        edgess=[str(guy) for guy in useful]
        print("Matching")
        print(" ".join(edgess))
    else:
        indep=[]
        for i in range(1,3*n+1):
            if used[i-1]==0:
                indep.append(i)
        useful=indep[:n]
        verts=[str(guy) for guy in useful]
        print("IndSet")
        print(" ".join(verts))

import sys
input=sys.stdin.readline
T=int(input())
for _ in range(T):
    n,m=map(int,input().split())
    edges=[0]*m
    for i in range(m):
        edges[i]=tuple(map(int,input().split()))
    used=set()
    edgess=[]
    check=0
    for i in range(m):
        if (edges[i][0] not in used) and (edges[i][1] not in used):
            edgess.append(i+1)
            used.add(edges[i][0])
            used.add(edges[i][1])
            check+=1
    if check>=n:
        useful=edgess[:n]
        edgess=[str(guy) for guy in useful]
        print("Matching")
        print(" ".join(edgess))
    else:
        indep=[]
        for i in range(1,3*n+1):
            if i not in used:
                indep.append(i)
        useful=indep[:n]
        verts=[str(guy) for guy in useful]
        print("IndSet")
        print(" ".join(verts))

from sys import stdin
input = stdin.readline
q = int(input())
for query in range(q):
	n, m = map(int, input().split())
	dupa = [0] * (3 * n + 1)
	edges = []
	for i in range(m):
		u, v = map(int, input().split())
		if dupa[u] == 0 and dupa[v] == 0:
			dupa[u] = 1
			dupa[v] = 1
			if len(edges) < n:
				edges.append(i+1)
	if len(edges) == n:
		print("Matching")
		print(*edges)
	else:
		print("IndSet")
		chuj = 0
		for i in range(1, 3 * n + 1):
			if chuj == n:
				break
			if dupa[i] == 0:
				if chuj < n - 1:
					print(i, end = " ")
				else:
					print(i)
				chuj += 1

import sys


def main():
    # sys.stdin = open("in.txt", "r")
    # sys.stdout = open("out.txt", "w")

    it = iter(map(int, sys.stdin.read().split()))

    t = next(it)
    for _ in range(t):
        n = next(it)
        m = next(it)

        total_node = 3 * n
        is_node_covered = [False for _ in range(total_node+1)]
        is_edge_in_matching = [False for _ in range(m+1)]
        matching_edge_count = 0

        for i in range(1, m+1):
            u = next(it)
            v = next(it)

            if (not is_node_covered[u]) and (not is_node_covered[v]):
                is_node_covered[u] = is_node_covered[v] = True
                is_edge_in_matching[i] = True
                matching_edge_count += 1

        ansL = []
        if matching_edge_count >= n:
            ansL.append('Matching\n')
            edge_taken = 0
            for i in range(1, m+1):
                if is_edge_in_matching[i]:
                    ansL.append(str(i) + ' ')
                    edge_taken += 1
                    if edge_taken == n: break
        else:
            ansL.append('IndSet\n')
            node_taken = 0
            for i in range(1, total_node+1):
                if not is_node_covered[i]:
                    ansL.append(str(i) + ' ')
                    node_taken += 1
                    if node_taken == n: break

        ansL.append('\n')
        sys.stdout.write(''.join(ansL))


def __starting_point():
    main()
__starting_point()

import sys
input = sys.stdin.readline
maxn=100005
hell=1000000007
vis = [0]*3*maxn
def meowmeow321():
    n,m=map(int,input().split())
    for i in range(3*n+1):
        vis[i]=0
    elst = []
    for i in range(m):
        x,y=map(int,input().split())
        if (not vis[x]) and (not vis[y]):
            vis[x]=1
            vis[y]=1
            elst.append(i+1)
    if len(elst)>=n :
        print("Matching")
        for i in range(n):
            print(elst[i],end=" ")
        print("")
    else:
        print("IndSet")
        cnt=0
        cur=1
        while cnt<n and cur<=3*n:
            if not vis[cur]:
                print(cur,end=" ")
                cnt+=1
            cur+=1
        print("")
t=int(input())
for xxx in range(t):
    meowmeow321()