#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3")


#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
const int mod = MOD;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);


vvm matmul(vvm a,vvm b){
  vvm c(a.size(),vm(b[0].size()));
  rep(i,a.size()){
    rep(j,b[0].size()){
      rep(k,b.size()){
        c[i][j]+=a[i][k]*b[k][j];
      }
    }
  }
  return c;
}
vvm fa(vvm a,vvm b){
  return matmul(b,a);
}
vvm matadd(vvm a,vvm b){
  rep(i,a.size()){
    rep(j,a[0].size()){
      a[i][j]+=b[i][j];
    }
  }
  return a;
}
//0-indexed,2冪のセグメントツリー
template <class T>
struct SegTree {
    private:
    int n;// 葉の数
    vector<T> data;// データを格納するvector
    T def; // 初期値かつ単位元
    function<T(T, T)> operation; // 区間クエリで使う処理
    function<T(T, T)> change;// 点更新で使う処理

    T find(int a, int b) {
        T val_left = def, val_right = def;
        for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1)
        {
            if ((a & 1) == 0){
                val_left = operation(val_left, data[a]);
            }
            if ((b & 1) == 0){
                val_right = operation(data[--b],val_right);
            }
        }
        return operation(val_left, val_right);
    }
    public:
    // _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
    // _change:更新関数
    SegTree(size_t _n, T _def, function<T(T, T)> _operation,
        function<T(T, T)> _change=[](T a,T b){return b;})
        : def(_def), operation(_operation), change(_change) {
        n = 1;
        while (n < _n) {
            n *= 2;
        }
        data = vector<T>(2 * n - 1, def);
    }
    void set(int i, T x) { data[i + n - 1] = x; }
    void build() {
        for (int k=n-2;k>=0;k--) data[k] = operation(data[2*k+1],data[2*k+2]);
    }
    // 場所i(0-indexed)の値をxで更新
    void update(int i, T x) {
        i += n - 1;
        data[i] = change(data[i], x);
        while (i > 0) {
            i = (i - 1) / 2;
            data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }
    T all_prod(){
      return data[0];
    }
    // [a, b)の区間クエリを実行
    T query(int a, int b) {
        //return _query(a, b, 0, 0, n);
        return find(a,b);
    }

    // 添字でアクセス
    T operator[](int i) {
        return data[i + n - 1];
    }
};

vvm ex={{1,0,0},{0,1,0},{0,0,1}};
struct node{
  vvm A,B,Z;
};
auto fx=[](node a,node b){
  node c;
  c.A=matmul(b.A,a.A);
  c.B=matmul(a.B,b.B);
  c.Z=matadd(matmul(a.B,matmul(b.Z,a.A)),a.Z);
  return c;
};

int main(){
  node ext;
  ext.A=ex;ext.B={{1,0},{0,1}};ext.Z={{0,0,0},{0,0,0}};
  ll n;cin >> n;
  vvm A(3,vm(1));rep(i,3)cin >>A[i][0];
  vvm B(2,vm(1));rep(i,2)cin >> B[i][0];
  SegTree<vvm> st(n,ex,fa);
  SegTree<node> nst(n,ext,fx);
  rep(i,n){
    ext.Z={{i*6+6,i*6+7,i*6+8},{i*6+9,i*6+10,i*6+11}};
    nst.set(i,ext);
  }
  nst.build();
  ll q;cin >> q;
  while(q--){
    string s;cin >> s;
    if(s=="a"){
      ll i;cin >> i;
      vvm a(3,vm(3));
      rep(i,3)rep(j,3)cin >> a[i][j];
      st.update(i,a);
      if(i){
        auto f=nst[i-1];
        f.A=a;
        nst.update(i-1,f);
      }
    }
    else if(s=="b"){
      ll i;cin >> i;i--;
      vvm b(2,vm(2));
      rep(i,2)rep(j,2)cin >> b[i][j];
      auto f=nst[i];
      f.B=b;
      nst.update(i,f);
    }
    else if(s=="ga"){
      ll p;cin >> p;
      auto f=st.query(0,p);
      /*rep(i,3){
        rep(j,3){
          cout << f[i][j] <<" ";
        }
        cout << endl;
      }*/
      f=matmul(f,A);
      rep(i,3)cout << f[i][0] <<" ";cout << endl;
    }
    else{
      ll p;cin >> p;
      //cout << "gb" <<" ";
      auto f=nst.query(p,n);
      auto k=st.query(0,p+1);
      auto ans=matadd(matmul(f.B,B),matmul(f.Z,matmul(k,A)));
      rep(i,2)cout << ans[i][0] <<" ";cout << endl;
    }
  }

}