#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1'000'000'009;
using Mint = ModInt<MO>;


constexpr int MAX_N = 100'010;


namespace ds_brute {
int len;
Mint sum, fs[MAX_N];
void print() {
  cerr << "[ds] sum = " << sum << ", fs = "; pv(fs + 1, fs + (len + 1));
}
void init(int len_) {
  len = len_;
  sum = 0;
  fill(fs, fs + (len + 1), 0);
}
void change(int a, Mint val) {
  assert(1 <= a); assert(a <= len);
  sum -= fs[a];
  sum += fs[a] = val;
}
Mint get(int a) {
  assert(1 <= a); assert(a <= len);
  return fs[a];
}
void mul(Mint val) {
  sum *= val;
  for (int a = 1; a <= len; ++a) fs[a] *= val;
}
void add(Mint val) {
  sum += len * val;
  for (int a = 1; a <= len; ++a) fs[a] += val;
}
}  // ds_brute


namespace ds {
int len;
Mint sum, fs[MAX_N];
// f -> p f + q
Mint p, q;
int zeit, zero, when[MAX_N];
void init(int len_) {
  len = len_;
  sum = 0;
  fill(fs, fs + (len + 1), 0);
  p = 1;
  q = 0;
  zeit = 0;
  zero = 0;
  fill(when, when + (len + 1), 0);
}
Mint get(int a) {
  assert(1 <= a); assert(a <= len);
  return (zero < when[a]) ? (p * fs[a] + q) : q;
}
void change(int a, Mint val) {
  assert(1 <= a); assert(a <= len);
  sum -= get(a);
  sum += val;
  fs[a] = (val - q) / p;
  when[a] = ++zeit;
}
void mul(Mint val) {
  sum *= val;
  if (val) {
    p *= val;
    q *= val;
  } else {
    p = 1;
    q = 0;
    zero = ++zeit;
  }
}
void add(Mint val) {
  sum += len * val;
  q += val;
}
}  // ds


int N, C;
int A[2][MAX_N];

enum { AB, BA, Ax, xA, Bx, xB, xy, U };
Mint dp[MAX_N][U], all[MAX_N];

int main() {
  for (; ~scanf("%d%d", &N, &C); ) {
    for (int x = 0; x < 2; ++x) for (int y = 0; y < N; ++y) {
      scanf("%d", &A[x][y]);
    }
    
    /*
      [from][to]
      to: for particular x, y (not the sum)
    */
    const Mint trans[U][U] = {
      //        AB   BA   Ax   xA   Bx   xB   xy
      /* AB */ {0  , 1  , 0  , 1  , 1  , 0  , 1  },
      /* BA */ {1  , 0  , 1  , 0  , 0  , 1  , 1  },
      /* A? */ {0  , C-2, 0  , C-2, C-3, C-2, C-3},
      /* ?A */ {C-2, 0  , C-2, 0  , C-2, C-3, C-3},
      /* B? */ {C-2, 0  , C-3, C-2, 0  , C-2, C-3},
      /* ?B */ {0  , C-2, C-2, C-3, C-2, 0  , C-3},
      /* ?? */ {Mint(C-2)*(C-3), Mint(C-2)*(C-3), Mint(C-3)*(C-3), Mint(C-3)*(C-3), Mint(C-3)*(C-3), Mint(C-3)*(C-3), Mint(C-2)*(C-3)-2*(C-3)+1},
    };
    memset(dp, 0, sizeof(dp));
    dp[0][AB] = 1;
    for (int n = 0; n < N; ++n) {
      for (int u = 0; u < U; ++u) for (int v = 0; v < U; ++v) {
        dp[n + 1][v] += dp[n][u] * trans[u][v];
      }
    }
    for (int n = 0; n <= N; ++n) {
      all[n] = 0;
      all[n] += (dp[n][AB] + dp[n][BA]);
      all[n] += (C-2) * (dp[n][Ax] + dp[n][xA] + dp[n][Bx] + dp[n][xB]);
      all[n] += Mint(C-2)*(C-3) * dp[n][xy];
    }
// cerr<<"all = ";pv(all,all+(N+1));
    
    bool ok = true;
    for (int x = 0; x < 2; ++x) for (int y = 0; y < N - 1; ++y) if (A[x][y] && A[x][y + 1]) ok = ok && (A[x][y] != A[x][y + 1]);
    for (int y = 0; y < N; ++y) if (A[0][y] && A[1][y]) ok = ok && (A[0][y] != A[1][y]);
    Mint ans = 0;
    if (ok) {
      vector<int> ys;
      for (int y = 0; y < N; ++y) if (A[0][y] || A[1][y]) {
        ys.push_back(y);
      }
      const int ysLen = ys.size();
      if (ysLen == 0) {
        ans = Mint(C)*(C-1) * all[N - 1];
      } else {
        ds::init(C);
        {
          const int y = ys[0];
          const int x = A[0][y] ? 0 : 1;
          const int a = A[x][y];
          ds::add(all[y - 0]);
          ds::change(a, 0);
          if (A[0][y] && A[1][y]) {
            ds::mul(0);
            ds::change(A[1][y], all[y - 0]);
          }
// ds::print();
        }
        for (int i = 0; i < ysLen - 1; ++i) {
          const int y0 = ys[i];
          const int y1 = ys[i + 1];
          const Mint *d = dp[y1 - y0];
// cerr<<y0<<" -> "<<y1<<": d = ";pv(d,d+U);
          const int x0 = A[0][y0] ? 0 : 1;
          const int x1 = A[0][y1] ? 0 : 1;
          const bool s = (x0 != x1);
          const int a0 = A[x0][y0];
          const int a1 = A[x1][y1];
          if (a0 != a1) {
            const Mint sum = ds::sum;
            const Mint f1 = ds::get(a1);
            ds::mul(d[s?Bx:xB] - d[xy]);
            ds::add(f1 * d[s?xB:Bx] + (sum - f1) * d[xy]);
            ds::change(a0, f1 * d[s?AB:BA] + (sum - f1) * d[s?Ax:xA]);
          } else {
            const Mint sum = ds::sum;
            ds::mul(d[s?BA:AB] - d[s?xA:Ax]);
            ds::add(sum * d[s?xA:Ax]);
          }
          ds::change(a1, 0);
          if (A[0][y1] && A[1][y1]) {
            const Mint f = ds::get(A[1][y1]);
            ds::mul(0);
            ds::change(A[1][y1], f);
          }
// ds::print();
        }
        {
          const int y = ys[ysLen - 1];
          ans += ds::sum * all[(N-1) - y];
        }
      }
    }
    printf("%u\n", ans.x);
  }
  return 0;
}