Write a program that finds all occurences of a given pattern in a given input string. This is often referred to as finding a needle in a haystack. The program has to detect \textbf{all} occurences of the needle in the haystack. \InputFile The input consists of a number of test cases. Each test case is composed of three lines, containing: \begin{itemize} \item the length of the needle, \item the needle itself, \item the haystack. \end{itemize} The length of the needle is only limited by the memory available to your program, so do not make any assumptions - instead, read the length and allocate memory as needed. The haystack is not limited in size, which implies that your program should not read the whole haystack at once. The test cases come one after another, each occupying three lines, with no additional space or line breaks in between. \OutputFile For each test case your program should output all positions of the needle's occurences within the haystack. If a match is found, the output should contain the position of the first character of the match. Characters in the haystack are numbered starting with zero. For a given test case, the positions output should be sorted in ascending order, and each of these should be printed in a separate line. For two different test cases, the positions should be separated by an empty line.