Number Sequence来源：HDU标签：字符串、字符串匹配、KMP算法参考资料：相似题目：题目Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 = M = 10000, 1 = N = 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], … , a[K + M - 1] = b[M]. If there are more than one K exist, output the smallest one.输入The first line of input is a number T which indicate the number of cases. Each case contains three lines. The first line is two numbers N and M (1 = M = 10000, 1 = N = 1000000). The second line contains N integers which in
