package main

import (
	"bufio"
	"fmt"
	"os"
)

func solve() {
	reader := bufio.NewReader(os.Stdin)
	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()

	var t int
	if _, err := fmt.Fscan(reader, &t); err != nil {
		return
	}

	for tc := 0; tc < t; tc++ {
		var n, q int
		fmt.Fscan(reader, &n, &q)

		rides := make([][]int, q)
		for i := 0; i < q; i++ {
			var k int
			fmt.Fscan(reader, &k)
			rides[i] = make([]int, k)
			for j := 0; j < k; j++ {
				fmt.Fscan(reader, &rides[i][j])
			}
		}

		nextNode := make([]map[int]int, n+1)
		for i := 1; i <= n; i++ {
			nextNode[i] = make(map[int]int)
		}

		human := false
	out:
		for _, ride := range rides {
			k := len(ride)
			for i := 0; i < k-1; i++ {
				u := ride[i]
				nxt := ride[i+1]
				
				for j := i + 1; j < k; j++ {
					v := ride[j]
					if existing, exists := nextNode[u][v]; exists {
						if existing != nxt {
							human = true
							break out
						}
					} else {
						nextNode[u][v] = nxt
					}
				}
			}
		}

		if human {
			fmt.Fprintln(writer, "Human")
		} else {
			fmt.Fprintln(writer, "Robot")
		}
	}
}

func main() {
	solve()
}