#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/convolution>
using mint = atcoder::modint998244353;

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int X, Y, Z;
    cin >> X >> Y >> Z;
    swap(X, Z);
    vector p(2, vector<vector<tuple<int, int, int>>>(2));
    rep(rp, 0, 2) {
        int id = 0;
        rep(i, 0, X) {
            rep(j, 0, Y) {
                rep(k, 0, Z) {
                   id++;
                    char c;
                    cin >> c;
                    if (c == 'B') p[rp][0 ^ rp].push_back({i, j, k});
                    if (c == 'W') p[rp][1 ^ rp].push_back({i, j, k});
                }
            }
        }
    }
    int S = X * Y * Z;
    auto f = [&](tuple<int, int, int> a) -> int {
        auto [x, y, z] = a;
        return x * Y * Z * 4 + y * Z * 2 + z;
    };
    vector<int> ans(X * Y * Z);
    rep(rp, 0, 2) {
        vector<mint> A(X * Y * Z * 8), B(X * Y * Z * 8);
        for (auto a : p[0][rp]) {
            rep(k, 0, 8) {
                auto [x, y, z] = a;
                if (k & 1) x += X;
                if (k & 2) y += Y;
                if (k & 4) z += Z;
                A[f({x, y, z})] = 1;
            }
        }
        for (auto b : p[1][rp]) {
            B[f({X, Y, Z}) - f(b)] = 1;
        }
        auto C = atcoder::convolution(A, B);
        int id = 0;
        rep(i, 0, X) rep(j, 0, Y) rep(k, 0, Z) {
            ans[id++] += C[f({i + X, j + Y, k + Z})].val();
        }
    }
    // vec_out(ans);
    cout << vec_min(ans) << "\n";
}