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()

sl = len(s)
tl = len(t)

m = []

c = 0

for j in range(0,sl+1):
    for k in range(j,sl+1):
        #print(k,j,sl)
        #print(s[j:k])
        if t in s[j:k]:
            m.append(s[j:k])
            #print(s[j:k])
            c+=1

#print(c)
print len(list(set(m)))