#pragma GCC ta g("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include using namespace std; #define DEBUG #ifdef DEBUG template ostream &operator<<(ostream &os, const pair &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template ostream &operator<<(ostream &os, const vector &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif using namespace std; typedef long long ll; typedef vector vl; typedef vector vvl; typedef vector vc; typedef vector vs; typedef vector vb; typedef vector vd; typedef pair P; typedef pair pii; typedef vector

vpl; typedef tuple tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() template inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template inline bool chmax(T1 &a,T2 b){ if(a inline void print(T &a){ int sz = a.size(); for(auto itr = a.begin(); itr != a.end(); itr++){ cout << *itr; sz--; if(sz) cout << " "; } cout << "\n"; } template inline void print2(T1 a, T2 b){ cout << a << " " << b << "\n"; } template inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } void mark() {cout << "#" << "\n";} ll pcount(ll x) {return __builtin_popcountll(x);} //#include //using namespace atcoder; const int inf = (1<<30)-1; const ll linf = 1LL<<61; const int MAX = 510000; int dy[8] = {0,1,0,-1,1,-1,-1,1}; int dx[8] = {-1,0,1,0,1,-1,1,-1}; const double pi = acos(-1); const double eps = 1e-9; //const int mod = 1e9 + 7; const int mod = 998244353; int main(){ vs s(4); cin >> s[0] >> s[1]; int n = s[0].size(), m = s[1].size(); int mx = max(n,m); s[2] = s[0]; s[3] = s[1]; reverse(all(s[2])); reverse(all(s[3])); vector sum(4,vvl(mx+1,vl(26,0))); rep(i,4){ rep(j,s[i].size()){ rep(k,26){ sum[i][j+1][k] = sum[i][j][k] + (s[i][j] - k == 'a'); } } } auto get_id = [&](int Y) -> int { int p = 0; while((1< 0 && (1< Y) p--; } return (res%2)*2+1; }; auto f = [&](int k, char ch) -> int { int c = ch - 'a'; int a = k / ((n+m)*2); int b = k % ((n+m)*2); int res = 0; rep(i,4) res += sum[i][(int)s[i].size()][c] * a; if(b >= n){ res += sum[0][n][c]; }else{ res += sum[0][b][c]; return res; } if(b >= n+m){ res += sum[1][m][c]; }else{ int Y = a*2+1; res += sum[get_id(Y)][b-n][c]; return res; } if(b >= n*2+m){ res += sum[2][n][c]; }else{ res += sum[2][b-n-m][c]; return res; } res += sum[get_id(a*2+2)][b-n*2-m][c]; return res; }; int q; cin >> q; while(q--){ int l,r; cin >> l >> r; l--; char c; cin >> c; cout << f(r,c) - f(l,c) << "\n"; } }