Time Limit: 5000 MS Memory Limit: 131072 K

## Description

The genomes of two related species, like that of cabbage and turnip, may contain similar genes.
Their order in the genome may be different due to genome transpositions during evolution.
Your task is to compare two gene sequences, and to determine the segments that are common
to the genomes, i.e., the segments that contain the same genes in both genomes (although in a
possibly different order).
Genes in this application are not given by sequences of bases A, C, G and T as is usually done,
but are coded as a single integer. The two genomes that are compared consist of the same set
of integers, each a permutation of the numbers 1, . . . ,N, where N is the length of the genome.
A common segment i-j of the genomes is an interval 1 ¡Ü i ¡Ü j ¡Ü N such that elements starting
at position i and ending at position j of the first genome make up the same set of genes (integers)
as the elements at the same positions in the second genome, but possibly in a different order. We
are looking for minimal common segments, i.e., segments cannot contain smaller segments.
## Input

The first line of the input contains a single number: the number of test cases to follow. Each test
case has the following format:
* One line with one integer N, satisfying 1 ¡Ü N ¡Ü 100, 000: the length of the genome.
* One line with a permutation of the N integers 1, . . . ,N, representing the first genome.
* One line with a permutation of the N integers 1, . . . ,N, representing the second genome.
Integers on the same line are separated by single spaces.
## Output

For every test case in the input, the output should contain a single line, listing the minimal
segments i-j common to the two genomes, ordered from left to right. Segments are separated by
single spaces.
## Sample Input

2
10
1 2 3 6 4 7 5 8 9 10
3 2 1 4 5 6 7 8 10 9
5
2 1 4 5 3
2 4 5 3 1
## Sample Output

1-3 4-7 8-8 9-10
1-1 2-5
## Source

bapc 2010