#include <algorithm>
#include <cassert>
#include <iostream>
#include <iterator>
#include <numeric>
#include <vector>

#include <atcoder/convolution>
#include <atcoder/modint>

using mint = atcoder::static_modint<943718401>;

// <嘘解法 (WA)>
// ijk を i + j + k と解釈する。
mint S(const int n, mint x, std::vector<mint> a,
       const std::vector<mint>& b, const std::vector<mint>& c) {
  assert(n == std::ssize(a) - 1 &&
         n == std::ssize(b) - 1 &&
         n == std::ssize(c) - 1);

  if (x == 0) {
    mint s = 0;
    s += std::inner_product(a.begin(), a.end(), b.begin(), mint::raw(0)) * c[0];
    s += std::inner_product(std::next(a.begin()), a.end(),
                            std::next(c.begin()), mint::raw(0)) * b[0];
    return s;
  }

  x *= x;
  mint power_of_x = 1;
  for (int i = 0; i <= n; ++i) {
    a[i] *= power_of_x;
    power_of_x *= x;
  }
  const std::vector<mint> s = atcoder::convolution(b, c);
  return std::inner_product(a.begin(), a.end(), s.begin(), mint::raw(0));
}

int main() {
  constexpr int kMaxN = 200000;

  const auto GetMint = []() -> mint {
    int x;
    std::cin >> x;
    assert(0 <= x && x < mint::mod());
    return mint::raw(x);
  };

  int n;
  std::cin >> n;
  assert(0 <= n && n <= kMaxN);
  const mint x = GetMint();

  std::vector<mint> a(n + 1), b(n + 1), c(n + 1);
  std::ranges::for_each(a, [GetMint](mint& x) -> void { x = GetMint(); });
  std::ranges::for_each(b, [GetMint](mint& x) -> void { x = GetMint(); });
  std::ranges::for_each(c, [GetMint](mint& x) -> void { x = GetMint(); });

  std::cout << S(n, x, a, b, c).val() << '\n';
  return 0;
}