#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define pob pop_back
#define SZ(x) (int)(x.size())
#define all(x) begin(x), end(x)
#ifdef LOCAL
#define HEHE freopen("in.txt", "r", stdin);
#define debug(...) {cerr << #__VA_ARGS__ << " = "; dbg(__VA_ARGS__);}
#else
#define HEHE ios_base::sync_with_stdio(0), cin.tie(0);
#define debug(...) 7122;
#endif
using namespace std;

#define chmax(a, b) (a) = (a) > (b) ? (a) : (b)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)

#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
void dbg() { cerr << '\n'; }
template<typename T, typename ...U>
void dbg(T t, U ...u) { cerr << t << ' '; dbg(u...); }

#define ll long long

const int MAXN = 2e5 + 5;

#define lc x * 2 + 1
#define rc x * 2 + 2

array<int, 3> rk[MAXN * 4];
array<int, 3> tag[MAXN * 4];

array<int, 3> Merge(array<int, 3> a, array<int, 3> b) {
    vector<pair<int, int>> tmp = {{a[0], b[0]}, {a[1], b[1]}, {a[2], b[2]}};
    sort(all(tmp)); tmp.resize(unique(all(tmp)) - tmp.begin());
    array<int, 3> res;
    FOR (i, 0, 2) 
        res[i] = lower_bound(all(tmp), make_pair(a[i], b[i])) - tmp.begin();
    return res;
}
void pull(int x) {
    rk[x] = Merge(rk[lc], rk[rc]);
}
void apply(int x, array<int, 3> p) {
    array<int, 3> nrk ,ntag;
    FOR (i, 0, 2) nrk[i] = rk[x][p[i]], ntag[i] = tag[x][p[i]];
    rk[x] = nrk;
    tag[x] = ntag;
}
void push(int x) {
    apply(lc, tag[x]);
    apply(rc, tag[x]);
    tag[x] = {0, 1, 2};
}
void upd(int x, int lx, int rx, int l, int r, array<int, 3> p) {
    if (lx >= l and rx <= r) return apply(x, p);
    if (lx >= r or rx <= l) return;
    push(x);
    int m = (lx + rx) / 2;
    upd(lc, lx, m, l, r, p);
    upd(rc, m, rx, l, r, p);
    pull(x);
}
array<int, 3> qry(int x, int lx, int rx, int l, int r) {
    if (lx >= l and rx <= r) return rk[x];
    push(x);
    int m = (lx + rx) / 2;
    if (r <= m) return qry(lc, lx, m, l, r);
    if (l >= m) return qry(rc, m, rx, l, r);
    return Merge(qry(lc, lx, m, l, r), qry(rc, m, rx, l, r));
}
string s[3];
void build(int x, int lx, int rx) {
    tag[x] = {0, 1, 2};
    if (lx + 1 == rx) {
        rk[x] = {s[0][lx] - 'a', s[1][lx] - 'a', s[2][lx] - 'a'};
        vector<int> v;
        FOR (i, 0, 2) v.pb(rk[x][i]);
        sort(all(v));
        v.resize(unique(all(v)) - v.begin());
        FOR (i, 0, 2) rk[x][i] = lower_bound(all(v), rk[x][i]) - v.begin();
        return;
    }
    int m = (lx + rx) / 2;
    build(lc, lx, m);
    build(rc, m, rx);
    pull(x);
}
string t[3];
void dfs(int x, int lx, int rx) {
    if (lx + 1 == rx) {
        FOR (i, 0, 2) {
            t[i] += s[tag[x][i]][lx];
        }
        return;
    }
    push(x);
    int m = (lx + rx) / 2;
    dfs(lc, lx, m);
    dfs(rc, m, rx);
}
int n, q;
signed main() {
    HEHE
    cin >> n >> q;
    FOR (i, 0, 2) cin >> s[i];
    build(0, 0, n);
    while (q--) {
        int l, r; cin >> l >> r;
        auto rk1 = qry(0, 0, n, l - 1, r);
        array<int, 3> p = {0, 1, 2};
        sort(all(p), [&](auto x, auto y) {
            return rk1[x] < rk1[y];
        });
        upd(0, 0, n, l - 1, r, p);
    }
    dfs(0, 0, n);
    FOR (i, 0, 2) cout << t[i] << '\n';
}