You are given two strings a and b that are made of lowercase english alphabets. find the number of diffrent pairs((i,j),(k,l)) such that the substring A(i...j) and B(k....l) are equal and the value if j-k+1 is minimum.

Input:
str1=abdc
str2=bd

Output:
2