B'Kaavi, the mysterious fortune teller, deeply believes that one 's fate is inevitable and unavoidable. Of course, she makes her living by predicting others ' future. While doing divination, Kaavi believes that magic spells can provide great power for her to see the future. Kaavi has a string T of length m and all the strings with the prefix T are magic spells. Kaavi also has a string S of length n and an empty string A . During the divination, Kaavi needs to perform a sequence of operations. There are two different operations: Kaavi can perform no more than n operations. To finish the divination, she wants to know the number of different operation sequences to make A a magic spell (i.e. with the prefix T ). As her assistant, can you help her? The answer might be huge, so Kaavi only needs to know the answer modulo 998 ,244 ,353 . Two operation sequences are considered different if they are different in length or there exists an i that their i -th operation is different. A substring is a contiguous sequence of characters within a string. A prefix of a string S is a substring of S that occurs at the beginning of S . The first line contains a string S of length n ( 1 <= q n <= q 3000 ). The second line contains a string T of length m ( 1 <= q m <= q n ). Both strings contain only lowercase Latin letters. The output contains only one integer -- the answer modulo 998 ,244 ,353 . The first test: The red ones are the magic spells. In the first operation, Kaavi can either add the first character "a" at the front or the back of A , although the results are the same, they are considered as different operations. So the answer is 6 x 2=12 . '...