Description
You are given two strings S and T, such that length of S is greater than the length of T.
Then a substring of S is defined as a sequence of characters which appear consecutively in S.

Find the total number of distinct substrings of M such that T is a substring of M

Input Format
One line containing strings S and T separated by a space.

Output Format
One line containing the number of distinct substrings of M such that T is a substring of M

Input Limits:
0 < Length(S), Length(T) < 100

SAMPLE INPUT
abcc c

SAMPLE OUTPUT
6

Explanation

Suppose  the  string  S  is  abcc.  Then  the  distinct  substrings  of  S  are
a, b, c, ab, bc, cc, abc, bcc, abcc
s, t = raw_input().split()
#t=raw_input()
x=0;
l_t = len(t)
l_s = len(s)
substr= []
ans =[]
for i in range(l_s):
	for j in range(i,l_s):
		substr.append(s[i:j + 1])
		

for y in range(len(substr)):
	if (t in substr[y]):
		if(substr[y] not in ans):
			ans.append(substr[y])
 			x=x+1
#for i in range(len(substr)):	
	


#print substr
#print ans.count(t)
#print ans
print x