10870 - Recurrences

/*
+---------------------------------------------+
|                                             |
|       © 28/01/2024 (00:46) MinaMagdy        |
|                                             |
+---------------------------------------------+
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
#define endl "\n"
#define MOD 1000000007
#define INF 2000000000
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define sz(x) int(x.size())

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#include <ext/numeric>
using namespace __gnu_cxx;
typedef vector<vector<int>> matrix;
int mod;
struct mul
{
    int n;
    mul(int n) : n(n) {}
    matrix operator()(const matrix &a, const matrix &b)
    {
        matrix c(n, vector<int>(n, 0));
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                for (int k = 0; k < n; k++)
                {
                    c[i][j] += a[i][k] * 1ll * b[k][j] % mod;
                    if (c[i][j] >= mod)
                        c[i][j] -= mod;
                }
            }
        }
        return c;
    }
};

matrix identity_element(const mul &m)
{
    matrix res(m.n, vector<int>(m.n, 0));
    for (int i = 0; i < m.n; i++)
        res[i][i] = 1;
    return res;
}

void solve()
{
    int d, n, m;
    while (cin >> d >> n >> m, d || n || m)
    {
        mod = m;
        matrix t(d, vector<int>(d));
        for (int i = 0; i < d; i++)
        {
            if (i != d - 1)
                t[i][i + 1] = 1;
            cin >> t[d - 1][d - i - 1];
        }
        matrix f1(d, vector<int>(1));
        for (int i = 0; i < d; i++)
        {
            cin >> f1[i][0];
        }
        mul mm(d);
        matrix ret = mm(power(t, n - 1, mm), f1);
        cout << ret[0][0] << endl;
    }
}

int main(void)
{
    ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
    int testcase = 1;
    // cin >> testcase;
    while (testcase--)
        solve();
    return 0;
}