#include <bits/stdc++.h>
const int maxn = 1e6 + 9, mod = 998244353, inf = 0x3f3f3f3f;
int Read() {
  int x(0), f(1);
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3ll) + (x << 1ll) + c - '0';
    c = getchar();
  }
  return x * f;
}
void Chkmin(int &x, int y) {
  if (y < x) x = y;
}
void Chkmax(int &x, int y) {
  if (y > x) x = y;
}
int add(int x, int y) { return x += y, x >= mod ? x - mod : x; }
int dec(int x, int y) { return x -= y, x < 0 ? x + mod : x; }
int mul(int x, int y) { return 1ll * x * y % mod; }
int Pow(int base, int b) {
  int ret(1);
  while (b) {
    if (b & 1) ret = mul(ret, base);
    base = mul(base, base);
    b >>= 1;
  }
  return ret;
}
int n, K, m;
int a[maxn], b[maxn], mask1[(1 << 20)], mask2[(1 << 20)], masks[(1 << 20)],
    maskt[(1 << 20)];
void Init() {
  static int p[maxn];
  for (int i = 1; i <= K; ++i) {
    p[i] = i;
  }
  int up((1 << K) - 1);
  for (int i = 0; i <= up; ++i) {
    masks[i] = inf;
  }
  for (int i = 0; i <= up; ++i) {
    maskt[i] = 0;
  }
  {
    int tmp(0);
    for (int i = 1; i <= K; ++i) {
      tmp |= (1 << i - 1) * mask2[i];
    }
    maskt[tmp] = n + 1;
  }
  for (int i = n; i >= 1; --i) {
    int x(a[i]), y(b[i]);
    for (int j = 1; j <= K; ++j) {
      if (p[j] == x)
        p[j] = y;
      else if (p[j] == y)
        p[j] = x;
    }
    {
      int tmp(0);
      for (int j = 1; j <= K; ++j) {
        tmp |= (1 << j - 1) * mask1[p[j]];
      }
      Chkmin(masks[tmp], i);
    }
    {
      int tmp(0);
      for (int j = 1; j <= K; ++j) {
        tmp |= (1 << j - 1) * mask2[p[j]];
      }
      Chkmax(maskt[tmp], i);
    }
  }
}
void Solve() {
  static int lg[1 << 20];
  int up((1 << K) - 1);
  for (int i = 0; i < K; ++i) {
    for (int j = 0; j <= up; ++j)
      if (!((j >> i) & 1)) {
        Chkmin(masks[j], masks[j ^ (1 << i)]);
        Chkmax(maskt[j], maskt[j ^ (1 << i)]);
      }
  }
  int l(1), r(1);
  int ret(0);
  for (int i = 0; i <= up; ++i) {
    lg[i] = lg[i >> 1] + (i & 1);
    if (maskt[i] - masks[i] >= m) {
      if (lg[i] > ret) {
        ret = lg[i];
        l = masks[i];
        r = maskt[i] - 1;
      }
      Chkmax(ret, lg[i]);
    }
  }
  int p(0), q(0);
  for (int i = 1; i <= K; ++i) p += mask1[i];
  for (int i = 1; i <= K; ++i) q += mask2[i];
  ret = ret * 2;
  ret += K - p - q;
  printf("%d\n", ret);
  printf("%d %d\n", l, r);
}
char s[maxn];
int main() {
  n = Read();
  m = Read();
  K = Read();
  scanf(" %s", s + 1);
  for (int i = 1; i <= K; ++i) {
    mask1[i] = s[i] - '0';
  }
  scanf(" %s", s + 1);
  for (int i = 1; i <= K; ++i) {
    mask2[i] = s[i] - '0';
  }
  for (int i = 1; i <= n; ++i) {
    a[i] = Read();
    b[i] = Read();
  }
  Init();
  Solve();
  return 0;
}
