#include <bits/stdc++.h>   using namespace std;   template <typename T, typename U>   std::istream& operator>>(std::istream& i, pair<T, U>& p) {     i >> p.first >> p.second;     return i;   }   template <typename T>   std::istream& operator>>(std::istream& i, vector<T>& t) {     for (auto& v : t) {       i >> v;     }     return i;   }   template <typename T, typename U>   std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {     o << p.first <<     << p.second;     return o;   }   template <typename T>   std::ostream& operator<<(std::ostream& o, const vector<T>& t) {     if (t.empty()) o <<   n ;     for (size_t i = 0; i < t.size(); ++i) {       o << t[i] <<    n [i == t.size() - 1];     }     return o;   }   template <typename T>   using minheap = priority_queue<T, vector<T>, greater<T>>;   template <typename T>   using maxheap = priority_queue<T, vector<T>, less<T>>;   unsigned int logceil(long long first) {     return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;   }   namespace std {   template <typename T, typename U>   struct hash<pair<T, U>> {     hash<T> t;     hash<U> u;     size_t operator()(const pair<T, U>& p) const {       return t(p.first) ^ (u(p.second) << 7);     }   };   }  // namespace std   template <typename T, typename F>   T bsh(T l, T h, const F& f) {     T r = -1, m;     while (l <= h) {       m = (l + h) / 2;       if (f(m)) {         l = m + 1;         r = m;       } else {         h = m - 1;       }     }     return r;   }   template <typename F>   double bshd(double l, double h, const F& f, double p = 1e-9) {     unsigned int r = 3 + (unsigned int)log2((h - l) / p);     while (r--) {       double m = (l + h) / 2;       if (f(m)) {         l = m;       } else {         h = m;       }     }     return (l + h) / 2;   }   template <typename T, typename F>   T bsl(T l, T h, const F& f) {     T r = -1, m;     while (l <= h) {       m = (l + h) / 2;       if (f(m)) {         h = m - 1;         r = m;       } else {         l = m + 1;       }     }     return r;   }   template <typename F>   double bsld(double l, double h, const F& f) {     unsigned int r = 200;     while (r--) {       double m = (l + h) / 2;       if (f(m)) {         h = m;       } else {         l = m;       }     }     return (l + h) / 2;   }   template <typename T>   T gcd(T a, T b) {     if (a < b) swap(a, b);     return b ? gcd(b, a % b) : a;   }   template <typename T>   class vector2 : public vector<vector<T>> {    public:     vector2() {}     vector2(size_t a, size_t b, T t = T())         : vector<vector<T>>(a, vector<T>(b, t)) {}   };   template <typename T>   class vector3 : public vector<vector2<T>> {    public:     vector3() {}     vector3(size_t a, size_t b, size_t c, T t = T())         : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}   };   template <typename T>   class vector4 : public vector<vector3<T>> {    public:     vector4() {}     vector4(size_t a, size_t b, size_t c, size_t d, T t = T())         : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}   };   template <typename T>   class vector5 : public vector<vector4<T>> {    public:     vector5() {}     vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())         : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}   };   class GOmkarAndPies {    public:     vector<std::pair<int, int>> D;     int N, M, K;     void fix(int p) {       for (int i = 0; i < K; ++i) {         int s = p ^ 1 << i;         if (D[s].first > D[p].first + 1) {           D[s] = {D[p].first + 1, D[p].second};           fix(s);         }       }     };     void solve(istream& cin, ostream& cout) {       cin >> N >> M >> K;       string S, T;       cin >> S >> T;       vector<std::pair<int, int>> P(N);       cin >> P;       for (std::pair<int, int>& p : P) {         p.first--;         p.second--;       }       vector<int> X(K);       iota(X.begin(), X.end(), 0);       vector<vector<int>> W{X};       for (int i = 0; i < N; ++i) {         swap(X[P[i].first], X[P[i].second]);         vector<int> I(K);         for (int j = 0; j < K; ++j) I[X[j]] = j;         W.push_back(X);       }       auto apply = [&](int first, string S) {         int p = 0;         for (int i = 0; i < K; ++i) {           p |= (S[i] -  0 ) << W[first][i];         }         return p;       };       D.assign(1 << K, {K + 1, -1});       pair<int, std::pair<int, int>> ans{K + 1, {-1, -1}};       for (int i = N - M; i >= 0; --i) {         int TX = apply(i + M, T);         D[TX] = {0, i + M};         fix(TX);         int SX = apply(i, S);         ans = min(ans, {D[SX].first, {i + 1, D[SX].second}});       }       cout << K - ans.first <<   n  << ans.second <<   n ;     }   };   int main() {     ios_base::sync_with_stdio(false);     cin.tie(nullptr);     cout.tie(nullptr);     GOmkarAndPies solver;     std::istream& in(std::cin);     std::ostream& out(std::cout);     solver.solve(in, out);     return 0;   }