Killjee and string

3

1 votes
Easy
Problem

Killjee has two strings A and B, string A and B consists of lowercase english alphabets. Beer came and messed up killjee's string B by replacing a character of B with .

Now killjee wonders that, by putting any string or removing , how many substrings of A can he generate from B.

INPUT

Two space sepearated string A and B

OUTPUT

Print number of substrings of A which can be formed from B by replacing character by any string or removing it.

CONSTRAINTS

1|A|,|B|103

B has only one occurence of and doesn't occur at either end of string.

Time Limit: 1
Memory Limit: 256
Source Limit:
Editor Image

?