mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    X = input().rstrip('\n')
    Y = input().rstrip('\n')
    NX = len(X)
    NY = len(Y)
    NXY = NX + NY

    cs_X = [[0] * (NX+1) for _ in range(26)]
    for i in range(NX):
        x = X[i]
        for j in range(26):
            c = chr(j + 97)
            if c == x:
                cs_X[j][i+1] = cs_X[j][i] + 1
            else:
                cs_X[j][i+1] = cs_X[j][i]
    cs_Y = [[0] * (NY+1) for _ in range(26)]
    for i in range(NY):
        y = Y[i]
        for j in range(26):
            c = chr(j + 97)
            if c == y:
                cs_Y[j][i+1] = cs_Y[j][i] + 1
            else:
                cs_Y[j][i+1] = cs_Y[j][i]

    def calc(i, c):
        j = ord(c) - 97
        p = i // NXY
        res = p * (cs_X[j][-1] + cs_Y[j][-1])
        q = i % NXY
        
        if q == 0:
            return res

        # X
        pp = i // (2 * NXY)
        if pp & 1:
            # rev
            res += cs_X[j][NX] - cs_X[j][max(0, NX - q)]
        else:
            res += cs_X[j][min(q, NX)]

        # Y
        if q > NX:
            ppp = p + 1
            cnt = 0
            while True:
                r = 1 << (ppp.bit_length())
                ppp_new = r - ppp
                if ppp_new == ppp:
                    break
                ppp = ppp_new
                cnt += 1
            qq = q - NX
            if cnt & 1:
                # rev
                res += cs_Y[j][NY] - cs_Y[j][NY - qq]
            else:
                res += cs_Y[j][qq]
        return res

    Q = int(input())
    for _ in range(Q):
        l, r, c = input().split()
        l = int(l)
        r = int(r)
        print(calc(r, c) - calc(l-1, c))


if __name__ == '__main__':
    main()