#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 5, mod = 1e9 + 7;
ll n, m, q, idx, base[N], rt[N];
struct node {
    ll l, r, ls, rs, val; 
} t[20000005];
char s[N];
void pushup(ll p) {
    ll ls = t[p].ls, rs = t[p].rs;
    t[p].val = (t[ls].val * base[t[rs].r - t[rs].l + 1] + t[rs].val) % mod;
}
int build(ll p, ll l, ll r) {
    p = ++idx;
    t[p].l = l, t[p].r = r;
    if (l == r) {
        t[p].val = s[l] - 'a' + 1; 
    } else {
        int mid = (l + r) >> 1;
        t[p].ls = build(t[p].ls, l, mid);
        t[p].rs = build(t[p].rs, mid + 1, r);
        pushup(p);
    }
    return p;
}
void update(ll u, ll v, ll l, ll r) {
    if (l <= t[u].l && t[u].r <= r) {
        swap(t[u], t[v]);
    } else {
        int mid = (t[u].l + t[u].r) >> 1;
        if (l <= mid) update(t[u].ls, t[v].ls, l, r);
        if (r > mid) update(t[u].rs, t[v].rs, l, r);
        pushup(u), pushup(v);;
    }
}
ll query(ll p, ll r) {
    if (t[p].r <= r) {
        return t[p].val;
    }
    else {
        ll mid = (t[p].l + t[p].r) >> 1;
        if (r <= mid) return query(t[p].ls, r);
        else return (t[t[p].ls].val * base[r - mid] + query(t[p].rs, r)) % mod;
    }
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m;
    base[0] = 1;
    for (int i = 1; i <= n; i++) base[i] = base[i - 1] * 1000000 % mod;
    for (int i = 1; i <= m; i++) {
        cin >> s + 1;
        reverse(s + 1, s + n + 1);
        rt[i] = build(1, 1, n);
    }
    cin >> q;
    while (q--) {
        ll op, x, y, l, r;
        cin >> op >> x >> y >> l >> r;
        ll tl = n - r + 1, tr = n - l + 1;
        if (op & 1) {
            update(rt[x], rt[y], tl, tr);
        } else {
            cout << ((query(rt[x], tr) - query(rt[x], tl - 1) * base[tr - tl + 1]) % mod + mod) % mod  << "\n";
        }
    }
    return 0;
}