def y_plus(m): if m == 0 or m == 1: return 1 binM = list(map(int,list(bin(m)[2:]))) if pow(2,len(binM)) -m == pow(2,len(binM) -1): return 1 return -1 * y_plus(pow(2,len(binM)) - m) def change(S): return ord(S) - ord('a') X = list(input()) Y = list(input()) xacum = [[0] * 26 for _ in range(len(X)+1)] rev_xacum = [[0] * 26 for _ in range(len(X)+1)] yacum = [[0] * 26 for _ in range(len(Y)+1)] rev_yacum = [[0] * 26 for _ in range(len(Y)+1)] for i in range(len(X)): xacum[i+1][change(X[i])] += 1 for i in range(len(Y)): yacum[i+1][change(Y[i])] += 1 for i in range(1,len(X)+1): for k in range(26): xacum[i][k] += xacum[i-1][k] X.reverse() for i in range(len(X)): rev_xacum[i+1][change(X[i])] += 1 for i in range(1,len(X)+1): for k in range(26): rev_xacum[i][k] += rev_xacum[i-1][k] for i in range(1,len(Y)+1): for k in range(26): yacum[i][k] += yacum[i-1][k] Y.reverse() for i in range(len(Y)): rev_yacum[i+1][change(Y[i])] += 1 for i in range(1,len(Y)+1): for k in range(26): rev_yacum[i][k] += rev_yacum[i-1][k] Z = len(X) + len(Y) Q = int(input()) ANS = [] for _ in range(Q): L,R,C = input().split() L = int(L) R = int(R) l = (L-1) // Z tl = L % Z if tl == 0: tl = Z r = R //Z tr = R % Z ans = (xacum[-1][change(C)] + yacum[-1][change(C)]) * (r-l) if y_plus(l+1) == 1: if (l+1) % 2 == 1:#+X -> +Y ans -= xacum[min(tl-1,len(X))][change(C)] + yacum[max(tl-1-len(X),0)][change(C)] else:#-X -> + Y ans -= rev_xacum[min(tl-1,len(X))][change(C)] + yacum[max(tl-1-len(X),0)][change(C)] else: if (l+1) % 2 == 1:#+X -> -Y ans -= xacum[min(tl-1,len(X))][change(C)] + rev_yacum[max(tl-1-len(X),0)][change(C)] else:#-X -> + Y ans -= rev_xacum[min(tl-1,len(X))][change(C)] + rev_yacum[max(tl-1-len(X),0)][change(C)] if y_plus(r+1) == 1: if (r+1) % 2 == 1:#+X -> +Y ans += xacum[min(tr,len(X))][change(C)] + yacum[max(tr-len(X),0)][change(C)] else:#-X -> + Y ans += rev_xacum[min(tr,len(X))][change(C)] + yacum[max(tr-len(X),0)][change(C)] else: if (r+1) % 2 == 1:#+X -> -Y ans += xacum[min(tr,len(X))][change(C)] + rev_yacum[max(tr-len(X),0)][change(C)] else:#-X -> + Y ans += rev_xacum[min(tr,len(X))][change(C)] + rev_yacum[max(tr-len(X),0)][change(C)] ANS.append(ans) for i in range(Q): print(ANS[i])