The French author Georges Perec (1936--1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: \textit{Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…} Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive '\textbf{T}'s is not unusual. And they never use spaces. So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet \{'\textbf{A}', '\textbf{B}', '\textbf{C}', …, '\textbf{Z}'\} and two finite strings over that alphabet, a word \textbf{W} and a text \textbf{T}, count the number of occurrences of \textbf{W} in \textbf{T}. All the consecutive characters of \textbf{W} must exactly match consecutive characters of \textbf{T}. Occurrences may overlap. \InputFile The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format: One line with the word \textbf{W}, a string over \{'\textbf{A}', '\textbf{B}', '\textbf{C}', …, '\textbf{Z}'\}, with \textbf{1} ≤ |\textbf{W}| ≤ \textbf{10000} (here |\textbf{W}| denotes the length of the string \textbf{W}). One line with the text \textbf{T}, a string over \{'\textbf{A}', '\textbf{B}', '\textbf{C}', …, '\textbf{Z}'\}, with |\textbf{W}| ≤ |\textbf{T}| ≤ \textbf{1000000}. \OutputFile For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word \textbf{W} in the text \textbf{T}.