#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define V vector
#define pb push_back
typedef double db;

const LL mod = 444445555566666677;
const LL base = 23333;
LL mul(LL a, LL b) {
    return (__int128_t)a * b % mod;
}
LL MOD(LL x) {
    if(x >= mod) x -= mod;
    if(x < 0) x += mod;
    return x;
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    const int T = 370;
    int n, q; cin >> n >> q;
    string a, b, c; cin >> a >> b >> c;
    V<V<char>> blka(n / T + 1), blkb(n / T + 1), blkc(n / T + 1);
    V<LL> hsa, hsb, hsc;

    auto cal_hs = [&](const V<char> &v) -> LL {
        LL hs = 0;
        for(auto x : v) {
            hs = MOD(mul(hs, base) + x);
        }
        return hs;
    };

    for(int i = 0; i < n; i++) {
        blka[i / T].pb(a[i]);
        blkb[i / T].pb(b[i]);
        blkc[i / T].pb(c[i]);
    }

    for(auto &v : blka) hsa.pb(cal_hs(v));
    for(auto &v : blkb) hsb.pb(cal_hs(v));
    for(auto &v : blkc) hsc.pb(cal_hs(v));

    auto swap_blk = [&](V<V<char>> &blka, V<V<char>> &blkb, V<LL> &hsa, V<LL> &hsb, int l, int r) -> void {
        if(l / T == r / T) {
            for(int i = l; i <= r; i++) {
                swap(blka[i / T][i % T], blkb[i / T][i % T]);
            }
            hsa[l / T] = cal_hs(blka[l / T]);
            hsb[l / T] = cal_hs(blkb[l / T]);
            return;
        }

        for(int i = l; i < (l / T + 1) * T; i++) {
            swap(blka[i / T][i % T], blkb[i / T][i % T]);
        }
        hsa[l / T] = cal_hs(blka[l / T]);
        hsb[l / T] = cal_hs(blkb[l / T]);

        for(int id = l / T + 1; id < r / T; id++) {
            swap(blka[id], blkb[id]);
            swap(hsa[id], hsb[id]);
        }

        for(int i = r / T * T; i <= r; i++) {
            swap(blka[i / T][i % T], blkb[i / T][i % T]);
        }
        hsa[r / T] = cal_hs(blka[r / T]);
        hsb[r / T] = cal_hs(blkb[r / T]);
    };
    auto greater_blk = [&](V<V<char>> &blka, V<V<char>> &blkb, V<LL> &hsa, V<LL> &hsb, int l, int r) -> bool {
        if(l / T == r / T) {
            for(int i = l; i <= r; i++) {
                if(blka[i / T][i % T] != blkb[i / T][i % T]) {
                    return blka[i / T][i % T] > blkb[i / T][i % T];
                }
            }
            return 0;
        }
        for(int i = l; i < (l / T + 1) * T; i++) if(blka[i / T][i % T] != blkb[i / T][i % T]) {
            return blka[i / T][i % T] > blkb[i / T][i % T];
        }
        for(int id = l / T + 1; id < r / T; id++) {
            if(hsa[id] != hsb[id]) {
                for(int i = id * T; i < (id + 1) * T; i++) if(blka[i / T][i % T] != blkb[i / T][i % T]) {
                    return blka[i / T][i % T] > blkb[i / T][i % T];
                }
            }
        }
        for(int i = r / T * T; i <= r; i++) if(blka[i / T][i % T] != blkb[i / T][i % T]) {
            return blka[i / T][i % T] > blkb[i / T][i % T];
        }
        return 0;
    };

    for(int i = 1; i <= q; i++) {
        int l, r; cin >> l >> r;
        l--, r--;
        if(greater_blk(blka, blkb, hsa, hsb, l, r)) swap_blk(blka, blkb, hsa, hsb, l, r);
        if(greater_blk(blka, blkc, hsa, hsc, l, r)) swap_blk(blka, blkc, hsa, hsc, l, r);
        if(greater_blk(blkb, blkc, hsb, hsc, l, r)) swap_blk(blkb, blkc, hsb, hsc, l, r);
    }

    for(auto v : blka) for(auto c : v) cout << c;
    cout << endl;
    for(auto v : blkb) for(auto c : v) cout << c;
    cout << endl;
    for(auto v : blkc) for(auto c : v) cout << c;
    cout << endl;
}