<Matrix Expo and Mult> TEMPLATE

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair <int, int>
#define piii pair<pii, int>
#define vi vector<int>
#define vpii vector<pii>

#define read1(a) int a; scanf("%d", &a)
#define read2(a, b) int a, b; scanf("%d %d", &a, &b)
#define read3(a, b, c) int a, b, c; scanf("%d %d %d", &a, &b, &c)

#define FOR(i, a, b) for (int i=a; i<b; i++)
#define F0R(i, a) for (int i=0; i<a; i++)

#define readgi(n) F0R(i, n) { scanf("%d", &arr[i]); }
#define readgs(n) F0R(i, n) { scanf(" %c", &arr[i]); }

#define f first
#define s second

#define usaco(in, out) freopen(in, "r", stdin); freopen(out, "w", stdout);

#define println1(a) printf("%d\n", a);
#define println2(a, b) printf("%d %d\n", a, b);
#define println3(a, b, c) printf("%d %d %d\n", a, b, c);
#define pv(v) for (int i : v) { printf("%d ", i); } printf("\n");

const int MOD = 1000000007;
const int MAX = 105;


vector<vector<int> > mult(vector<vi> a, vector<vi> b) {
    vector<vi> v(a.size(), vi(b[0].size(), 0));
    F0R(i, a.size()) {
        F0R(j, b[0].size()) {
            F0R(k, a[0].size()) {
                v[i][j] = (v[i][j] + a[i][k] * b[k][j]) % MOD;
            }
        }
    }
    return v;
}

vector<vector<int> > expo(vector<vi> a, int p) {
    vector<vi> v(a.size(), vi(a.size(), 0));
    F0R(i, a.size()) { v[i][i] = 1; }
    while (p) {
        if (p%2) { v = mult(v, a); }
        a = mult(a, a);
        p /= 2;
    }
    return v;
}

int main() {
    vector<vi> a = {{1,2},{2,3},{6,3}};
    vector<vi> b = {{1,2,4,6},{2,1,2,3}};
    vector<vi> c = mult(a, b);
    for (auto i : c) { for (auto j : i) { cout << j << " "; } cout << endl; }
}