import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.LongStream;

/**
 * https://kenkoooo.com/atcoder/#/contest/show/81132d99-128a-4588-a217-80a586662fc4
 */
public class Main {

    public Main() throws IOException {
    }

    public static void main(String[] args) throws IOException {
        new Main().solve();
    }

    //    private final InputStream in = Files.newInputStream(Paths.get("C:\\Users\\ryo.suzuki\\Downloads\\02.txt"));
    private final InputStream in = System.in;
    private final PrintWriter out = new PrintWriter(System.out);
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private void solve() throws IOException {
        try {
//            solveA();
//            solveB();
//            solveC();
//            solveD();
//            solveE();
            solveE2();
//            solveF();
        } finally {
            if (in != null) {
                in.close();
            }
            if (out != null) {
                out.flush();
                out.close();
            }
        }

    }

    // mods
    long MOD = (long) Math.pow(10, 9) + 7;

    /**
     * https://atcoder.jp/contests/abc131/tasks/abc131_b
     * B - Bite Eating
     */
    private void solveA() {
        int n = nextInt();
        int l = nextInt();
        int sum = 0;
        int minus = Integer.MAX_VALUE;
        int index = 0;
        for (int i = 1; i <= n; i++) {
            sum += (l + i - 1);
            if (minus > Math.abs((l + i - 1))) {
                minus = Math.abs((l + i - 1));
                index = i;
            }
        }
        out.println(sum - (l + index - 1));
    }

    /**
     * https://atcoder.jp/contests/abc066/tasks/abc066_b
     * B - ss
     */
    private void solveB() {
        String s = next();
        int n = s.length();
        for (int i = 1; i < n; i++) {
            int len = n - i;
            if (len % 2 != 0)
                continue;
            if (s.substring(0, len / 2).equals(s.substring(len / 2, len))) {
                out.println(len);
                return;
            }
        }
    }

    /**
     * https://atcoder.jp/contests/diverta2019/tasks/diverta2019_b
     * B - RGB Boxes
     */
    private void solveC() {
        int r = nextInt();
        int g = nextInt();
        int b = nextInt();
        int n = nextInt();
        int res = 0;
        for (int i = 0; i <= n / r; i++) {
            for (int j = 0; j <= n / g; j++) {
                /*
                k*b=n-(i * r + j * g);
                k=(n - (i * r + j * g)) / b;
                 */
                int k = (n - (i * r + j * g)) / b;
                if (k >= 0 && i * r + j * g + k * b == n)
                    res++;
//                for (int k = 0; k <= n / b; k++) {
//                    if (i * r + j * g + k * b == n)
//                        res++;
//                }
            }
        }
        out.println(res);
    }

    /**
     * https://atcoder.jp/contests/abc064/tasks/abc064_d
     * D - Insertion
     */
    private void solveD() {
        int n = nextInt();
        String s = next();
        int open = 0;
        int close = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == '(') {
                open++;
            } else {
                if (open == 0)
                    close++;
                else
                    open--;
            }
        }

        /*
        左に(を、右に)を足せば()の組を作るのは可能
        そして、辞書順最小も達成できる
         */
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < close; i++)
            sb.append('(');
        sb.append(s);
        for (int i = 0; i < open; i++)
            sb.append(')');
        out.println(sb.toString());
    }

    /**
     * https://atcoder.jp/contests/agc033/tasks/agc033_b
     * B - LRUD Game
     * <p>
     * https://betrue12.hateblo.jp/entry/2019/05/14/222544
     */
    private void solveE() {
        int h = nextInt();
        int w = nextInt();
        int n = nextInt();
        int sr = nextInt() - 1;
        int sc = nextInt() - 1;
        String s = next();
        String t = next();
        int[] S = new int[200000];
        int[] T = new int[200000];
        for (int i = 0; i < n; i++) {
            switch (s.charAt(i)) {
                case 'U':
                    S[i] = 0;
                    break;
                case 'D':
                    S[i] = 1;
                    break;
                case 'L':
                    S[i] = 2;
                    break;
                case 'R':
                    S[i] = 3;
                    break;
            }
            switch (t.charAt(i)) {
                case 'U':
                    T[i] = 0;
                    break;
                case 'D':
                    T[i] = 1;
                    break;
                case 'L':
                    T[i] = 2;
                    break;
                case 'R':
                    T[i] = 3;
                    break;
            }
        }

        for (int time = 0; time < 2; time++) {
            int add = 2 * time + 1;
            int sub = 2 * time;
            int start = (time == 0 ? sr : sc);
            int hw = (time == 0 ? h : w);
            long mx = hw - 1;
            long mn = 0;
            for (int i = n - 1; i >= 0; i--) {
                if (T[i] == sub) {
                    mx = min(hw - 1, mx + 1);
                } else if (T[i] == add) {
                    mn = max(0, mn - 1);
                }
                if (S[i] == add) {
                    mx--;
                } else if (S[i] == sub) {
                    mn++;
                }
                if (mn > mx) {
                    out.println("NO");
                    return;
                }
            }
            if (!(mn <= start && start <= mx)) {
                out.println("NO");
                return;
            }
        }
        out.println("YES");
    }

    private void solveE2() {
        int h = nextInt();
        int w = nextInt();
        int n = nextInt();
        int sr = nextInt() - 1;
        int sc = nextInt() - 1;
        char[] s = next().toCharArray();
        char[] t = next().toCharArray();
        {
            long left = 0;
            long right = w;
        /*
        最終手（N手目）で、枠外に行けないギリギリの位置
         */
            if (s[n - 1] == 'L')
                left++;
            if (s[n - 1] == 'R')
                right--;
        /*
        N-1手目から巻き戻す
         */
            for (int i = n - 2; i >= 0; i--) {
                if (t[i] == 'L') {
                    //                    left = left;
                    right = min(right + 1, w);
                } else if (t[i] == 'R') {
                    left = max(0, left - 1);
                    //                    right = right;
                }

                if (s[i] == 'L')
                    left = left + 1;
                else if (s[i] == 'R')
                    right = right - 1;

                if (left >= right) {
                    out.println("NO");
                    return;
                }
            }
//            if (!(left <= sc && sc < right)) {
            if (sc < left || sc >= right) {
                out.println("NO");
                return;
            }
        }
        {
            long left = 0;
            long right = h;
        /*
        最終手（N手目）で、枠外に行けないギリギリの位置
         */
            if (s[n - 1] == 'U')
                left++;
            if (s[n - 1] == 'D')
                right--;
        /*
        N-1手目から巻き戻す
         */
            for (int i = n - 2; i >= 0; i--) {
                if (t[i] == 'U') {
                    //                    left = left;
                    right = min(right + 1, h);
                } else if (t[i] == 'D') {
                    left = max(0, left - 1);
                    //                    right = right;
                }

                if (s[i] == 'U')
                    left = left + 1;
                else if (s[i] == 'D')
                    right = right - 1;

                if (left >= right) {
                    out.println("NO");
                    return;
                }
            }
//            if (!(left <= sr && sr < right)) {
            if (sr < left || sr >= right) {
                out.println("NO");
                return;
            }
        }
        out.println("YES");
    }

    /**
     * https://atcoder.jp/contests/abc131/tasks/abc131_f
     * F - Must Be Rectangular!
     * <p>
     * https://drken1215.hatenablog.com/entry/2019/06/23/004700
     */
    private void solveF() {
        int n = nextInt();
        int[][] xy = IntStream.range(0, n).mapToObj(i -> new int[]{nextInt() - 1, nextInt() - 1}).toArray(int[][]::new);
        final int CONST = 110000;
        Map<Integer, List<Integer>> graph = new HashMap<Integer, List<Integer>>();
        for (int[] item : xy) {
            int x = item[0];
            int y = item[1] + CONST;
            graph.put(x, graph.getOrDefault(x, new ArrayList<Integer>()));
            graph.get(x).add(y);
            graph.put(y, graph.getOrDefault(y, new ArrayList<Integer>()));
            graph.get(y).add(x);

        }
        boolean[] visited = new boolean[CONST * 2];
        long res = 0;
        for (int i = 0; i < CONST * 2; i++) {
            long[] cnt = new long[2];
            dfs(graph, visited, cnt, i, CONST);
            res += cnt[0] * cnt[1];
        }
        out.println(res - n);
    }

    private void dfs(Map<Integer, List<Integer>> graph, boolean[] visited, long[] cnt, int i, final int CONST) {
        if (visited[i])
            return;
        visited[i] = true;
        cnt[i / CONST]++;
        for (int child : graph.getOrDefault(i, new ArrayList<Integer>())) {
            dfs(graph, visited, cnt, child, CONST);
        }

    }

    private void solveFUnionFind() {
        int n = nextInt();
        final int CONST = 110000;
        UnionFind unionFind = new UnionFind(CONST * 2);
        for (int i = 0; i < n; i++) {
            unionFind.unite(nextInt() - 1, nextInt() - 1 + CONST);
        }
        // 連結成分ごとに、左ノードと右ノードの個数を数える
        Map<Integer, Long> mx = new HashMap<Integer, Long>();
        Map<Integer, Long> my = new HashMap<Integer, Long>();
        /*
        X側で、同じrootに属するものを数えていく
         */
        for (int i = 0; i < CONST; i++)
            mx.put(unionFind.getRoot(i), mx.getOrDefault(unionFind.getRoot(i), 0L) + 1L);
        /*
        Y側も同様
         */
        for (int i = CONST; i < CONST * 2; i++)
            my.put(unionFind.getRoot(i), my.getOrDefault(unionFind.getRoot(i), 0L) + 1L);
        long res = 0;
        /*
        同じrootに属するもの同士は、xの個数×yの個数が最大となる
         */
        for (int r = 0; r < CONST * 2; ++r)
            res += mx.getOrDefault(r, 0L) * my.getOrDefault(r, 0L);
        out.println(res - n);
    }

    public static class UnionFind {
        int[] pars;

        public UnionFind(int n) {
            pars = new int[n];
            Arrays.fill(pars, -1);
        }

        public int getChilds(int n) {
            int wk = getRoot(n);
            return pars[wk];
        }

        public int getRoot(int n) {
            if (pars[n] < 0)
                return n;
            return pars[n] = getRoot(pars[n]);
        }

        public boolean isSame(int a, int b) {
            return getRoot(a) == getRoot(b);
        }

        private int getSize(int a) {
            return -pars[getRoot(a)];
        }

        public void unite(int a, int b) {
            int wkA = getRoot(a);
            int wkB = getRoot(b);
            if (wkA == wkB)
                return;

            if (getSize(wkA) < getSize(wkB)) {
                int tmp = wkA;
                wkA = wkB;
                wkB = tmp;
            }
            pars[wkA] = pars[wkA] + pars[wkB];
            pars[wkB] = wkA;
        }
    }

    static final long CONST_INF = Long.MAX_VALUE / 4;


    private static class VectorCalculation {
        /**
         * 点Pと線(AB)の距離
         *
         * @param p
         * @param a
         * @param b
         * @return
         */
        private double distanceDotAndLine(DoublePair p, DoublePair a, DoublePair b) {
            DoublePair ab = new DoublePair(b.x - a.x, b.y - a.y);
            DoublePair ap = new DoublePair(p.x - a.x, p.y - a.y);

            // ベクトルAB、APの外積の絶対値が平行四辺形Dの面積になる
            double d = Math.abs(crossVector(ab, ap));

            double l = distanceVertex(a, b); // AB間の距離

            double h = d / l;
            return h;
        }

        /**
         * 2点間距離
         *
         * @param p1
         * @param p2
         * @return
         */
        private double distanceVertex(DoublePair p1, DoublePair p2) {
            double dx = p1.x - p2.x;
            double dy = p1.y - p2.y;
            return Math.sqrt(dx * dx + dy * dy);
        }

        /**
         * ベクトル外積
         *
         * @param vl
         * @param vr
         * @return
         */
        private double crossVector(DoublePair vl, DoublePair vr) {
            return vl.x * vr.y - vl.y * vr.x;
        }
    }

    private static class DoublePair implements Comparable<DoublePair> {
        double x;
        double y;

        public DoublePair(double k, double v) {
            this.x = k;
            this.y = v;
        }

        public int compareTo(DoublePair pair) {
            return Double.compare(this.y, pair.y);
        }
    }

    private static class SimplePair implements Comparable<SimplePair> {
        long k;
        long v;

        public SimplePair(int k, int v) {
            this.k = k;
            this.v = v;
        }

        public SimplePair(long k, long v) {
            this.k = k;
            this.v = v;
        }

        public int compareTo(SimplePair pair) {
            return Long.compare(this.v, pair.v);
        }
    }


    private static class SimpleGraphNode {
        private int n;
        private Map<Integer, Integer> childs;

        public SimpleGraphNode(int n) {
            this.n = n;
            childs = new HashMap<Integer, Integer>();
        }

        public void addChild(int child, int d) {
            this.childs.put(child, d);
        }
    }

    private static class SimpleGraph {

        private Map<Integer, SimpleGraphNode> graph;

        public SimpleGraph(int[][] list) {
            graph = new HashMap<Integer, SimpleGraphNode>();
            Arrays.stream(list).forEach(l -> {
                int a = l[0];
                int b = l[1];
                int d = l[2];
                graph.put(a, graph.getOrDefault(a, new SimpleGraphNode(a)));
                graph.get(a).addChild(b, d);
                graph.put(b, graph.getOrDefault(b, new SimpleGraphNode(b)));
                graph.get(b).addChild(a, d);
            });
        }

        public SimpleGraphNode getNode(int i) {
            return graph.getOrDefault(i, new SimpleGraphNode(-1));
        }

    }

    private static class GraphNode {
        private long n;
        private Map<Long, SimplePair> childs;

        public GraphNode(long n) {
            this.n = n;
            childs = new TreeMap<Long, SimplePair>();
        }

        /**
         * not update
         *
         * @param child
         * @param d
         */
        public void addChild(long child, long d) {
            this.childs.put(child, this.childs.getOrDefault(child, new SimplePair(child, d)));
        }

        public SimplePair getChild(long child) {
            return this.childs.getOrDefault(child, new SimplePair(child, CONST_INF));
        }
    }

    private static class Graph {

        private Map<Long, GraphNode> graph;
        int n;

        /**
         * @param n    頂点数
         * @param list
         */
        public Graph(int n, int[][] list) {
            this.n = n;
            graph = new HashMap<Long, GraphNode>();
            /*
            隣接行列作成
            0-indexed
             */
            Arrays.stream(list).forEach(l -> {
                long a = l[0] - 1;
                long b = l[1] - 1;
                long d = l[2];
                graph.put(a, graph.getOrDefault(a, new GraphNode(a)));
                graph.get(a).addChild(b, d);
                graph.put(b, graph.getOrDefault(b, new GraphNode(b)));
                graph.get(b).addChild(a, d);
            });
            /*
            たどり着けない場所はCONST_INFで埋める
            自分へはCOST=0でたどり着ける
             */
            for (long i = 0; i < n; i++) {
                graph.put(i, graph.getOrDefault(i, new GraphNode(i)));
                GraphNode node = graph.get(i);
                for (int j = 0; j < n; j++) {
                    if (i == j)
                        node.addChild(j, 0L);
                    else
                        node.addChild(j, CONST_INF);
                }
            }
        }

        /**
         * ワーシャルフロイド
         */
        public void warshallFloyd() {
            for (long k = 0; k < n; k++) {
                for (long i = 0; i < n; i++) {
                    for (long j = 0; j < n; j++) {
                        long min = Math.min(graph.get(i).getChild(j).v, graph.get(i).getChild(k).v + graph.get(k).getChild(j).v);
                        graph.get(i).getChild(j).v = min;
                    }
                }
            }
        }

        public void partialUpdateAndWarshallFloyd(long x, long y, long w) {
            if (graph.get(x).getChild(y).v > w)
                graph.get(x).getChild(y).v = graph.get(y).getChild(x).v = w;
            long[] l = {x, y};
            for (long k : l) {
                for (long i = 0; i < n; i++) {
                    for (long j = 0; j < n; j++) {
                        if (graph.get(i).getChild(j).v > graph.get(i).getChild(k).v + graph.get(k).getChild(j).v) {
                            graph.get(i).getChild(j).v = graph.get(i).getChild(k).v + graph.get(k).getChild(j).v;
                        }
                    }
                }
            }
        }

        /**
         * 2点間の距離
         *
         * @param from
         * @param to
         * @return
         */
        public long getDistance(long from, long to) {
            return graph.get(from).getChild(to).v;
        }

    }

    public long calcSimpleCombination(long n, long m, long CONST_MOD) {
        long mole = 1;
        for (long i = 1; i <= n + m; i++) {
            mole *= i;
            mole %= CONST_MOD;
        }
        long deno = 1;
        for (long i = 1; i <= n; i++) {
            deno *= i;
            deno %= CONST_MOD;
        }
        for (int i = 1; i <= m; i++) {
            deno *= i;
            deno %= CONST_MOD;
        }
        deno = modInverse(deno, CONST_MOD);
        return (mole * deno) % CONST_MOD;
    }

    long abs(double x) {
        return (long) Math.abs(x);
    }

    long round(double x) {
        return Math.round(x);
    }

    long floor(double x) {
        return (long) Math.floor(x);
    }

    long ceil(double x) {
        return (long) Math.ceil(x);
    }

    double sqrt(double x) {
        return Math.sqrt(x);
    }

    double pow(double x, double y) {
        return Math.pow(x, y);
    }

    long pow(long x, long y) {
        return (long) Math.pow(x, y);
    }

    int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    public long lcmMod(long... ab) {

        Map<Long, Long> ps = new HashMap<Long, Long>();

        for (int abl = 0; abl < ab.length; abl++) {
            long target = ab[abl];
            long l = target;
            for (long p = 2; p * p <= l; p++) {
                long cnt = 0;
                while (target > 1 && target % p == 0) {
                    cnt++;
                    target /= p;
                }
                if (cnt == 0)
                    continue;
                ps.put(p, Long.max(cnt, ps.getOrDefault(p, 0L)));
            }
            if (target > 1)
                ps.put(target, Long.max(1, ps.getOrDefault(target, 0L)));
        }
        long res = 1L;
        for (Map.Entry<Long, Long> e : ps.entrySet()) {
            res *= powMod(e.getKey(), e.getValue());
            res %= MOD;
        }
        return res;
    }

    int upperToInt(char a) {
        return a - 'A';
    }

    int lowerToInt(char a) {
        return a - 'a';
    }

    int numToInt(char a) {
        return a - '0';
    }

    int charToInt(char a) {
        return a >= 'a' ? lowerToInt(a) : a >= 'A' ? upperToInt(a) : numToInt(a);
    }

    char intToUpper(int a) {
        return (char) (a + 'A');
    }

    char intToLower(int a) {
        return (char) (a + 'a');
    }

    char intToNum(int a) {
        return (char) (a + '0');
    }

    void reverse(String array[]) {
        String reversed[] = new String[array.length];
        for (int i = 0; i < array.length; i++) {
            reversed[array.length - i - 1] = array[i];
        }
        for (int i = 0; i < array.length; i++) {
            array[i] = reversed[i];
        }
    }

    void reverse(int array[]) {
        int reversed[] = new int[array.length];
        for (int i = 0; i < array.length; i++) {
            reversed[array.length - i - 1] = array[i];
        }
        for (int i = 0; i < array.length; i++) {
            array[i] = reversed[i];
        }
    }

    void reverse(long array[]) {
        long reversed[] = new long[array.length];
        for (int i = 0; i < array.length; i++) {
            reversed[array.length - i - 1] = array[i];
        }
        for (int i = 0; i < array.length; i++) {
            array[i] = reversed[i];
        }
    }

    void reverse(double array[]) {
        double reversed[] = new double[array.length];
        for (int i = 0; i < array.length; i++) {
            reversed[array.length - i - 1] = array[i];
        }
        for (int i = 0; i < array.length; i++) {
            array[i] = reversed[i];
        }
    }

    void reverse(boolean array[]) {
        boolean reversed[] = new boolean[array.length];
        for (int i = 0; i < array.length; i++) {
            reversed[array.length - i - 1] = array[i];
        }
        for (int i = 0; i < array.length; i++) {
            array[i] = reversed[i];
        }
    }

    void fill(int array[][], int x) {
        for (int a[] : array) {
            Arrays.fill(a, x);
        }
    }

    void fill(long array[][], long x) {
        for (long a[] : array) {
            Arrays.fill(a, x);
        }
    }

    void fill(double array[][], double x) {
        for (double a[] : array) {
            Arrays.fill(a, x);
        }
    }

    void fill(boolean array[][], boolean x) {
        for (boolean a[] : array) {
            Arrays.fill(a, x);
        }
    }

    void fill(int array[][][], int x) {
        for (int a[][] : array) {
            fill(a, x);
        }
    }

    void fill(long array[][][], long x) {
        for (long a[][] : array) {
            fill(a, x);
        }
    }

    void fill(double array[][][], double x) {
        for (double a[][] : array) {
            fill(a, x);
        }
    }

    void fill(boolean array[][][], boolean x) {
        for (boolean a[][] : array) {
            fill(a, x);
        }
    }

    long L_INF = (long) 1e18 + 7;

    boolean isINF(long a) {
        return abs(a) > L_INF / 1000;
    }

    boolean isPlusINF(long a) {
        return a > 0 && isINF(a);
    }

    boolean isMinusINF(long a) {
        return isPlusINF(-a);
    }

    int I_INF = (int) 1e9 + 7;

    boolean isINF(int a) {
        return abs(a) > I_INF / 1000;
    }

    boolean isPlusINF(int a) {
        return a > 0 && isINF(a);
    }

    boolean isMinusINF(int a) {
        return isPlusINF(-a);
    }

    /**
     * 指定したx以下の素数をリストアップする
     */
    public long[] getPrimesUnderX(long x) {
        return LongStream.rangeClosed(2, x)
                .filter(i -> LongStream.rangeClosed(2, (long) Math.sqrt(i)).allMatch(j -> i % j != 0)).toArray();
    }


    public long mod(long i) {
        return i % MOD + ((i % MOD) < 0 ? MOD : 0);
    }

    long powMod(long x, long y) {
        if (y == 0) {
            return 1;
        } else {
            long tmp = powMod(x, y / 2);
            return mod(mod(tmp * tmp) * (y % 2 == 0 ? 1 : x));
        }
    }

    long inv(long x) {
        return powMod(x, MOD - 2);
    }

    int MAX_FACT = 5_000_100;
    long fact[];
    long invFact[];

    /**
     * Combination簡易版
     * 5 C 2
     * 異なる n個のものから r個を選ぶ組み合わせの総数 nCr を求めます。
     * 5!(5*4*3*2*1)
     * /
     * 2!(2*1) *  (5-2)!(3*2*1)
     *
     * @param n
     * @param r
     * @return
     */
    private long getComb(int n, int r) {
        long tmp = 1;
        for (int i = 1; i <= r; i++) {
            tmp *= n - i + 1;
            tmp = mod(tmp);
            tmp *= inv(i);
            tmp = mod(tmp);
        }
        return tmp;
    }

    /**
     * 階乗計算の事前累積和
     * [1, 1, 2, 3, 4, 5, … FACTORIAL_NUM]
     * mod済
     */
    void prepareFact() {
        fact = new long[MAX_FACT];
        Arrays.fill(fact, 0);
        invFact = new long[MAX_FACT];
        Arrays.fill(invFact, 0);
        fact[0] = 1;
        int maxIndex = (int) min(MAX_FACT, (int) MOD);
        for (int i = 1; i < maxIndex; i++) {
            fact[i] = mod(fact[i - 1] * i);
        }
        invFact[maxIndex - 1] = inv(fact[maxIndex - 1]);
        for (int i = maxIndex - 1; i > 0; i--) {
            invFact[i - 1] = mod(invFact[i] * i);
        }
    }

    /**
     * 順列
     * nPk -> n! / (n-k)!
     *
     * @param n
     * @param r
     * @return
     */
    long permutation(int n, int r) {
        if (n < 0 || r < 0 || n < r) {
            return 0;
        }
        return mod(fact[n] * invFact[n - r]);
    }

    /**
     * 組み合わせ
     * nCk -> n! / k!・(n-k)!
     *
     * @param n
     * @param r
     * @return
     */
    long combination(int n, int r) {
        if (n < 0 || r < 0 || n < r) {
            return 0;
        }
        return mod(permutation(n, r) * invFact[r]);
    }

    /**
     * 重複組合せ nHr （同次積）
     * nHr = (n+r-1)Cr
     * 異なるn個のものから重複を許してr個取る組合せの総数
     * 例：
     * リンゴ，ミカン，牛肉の3種類の果物があります．これらの中から6個の食材を買って帰ります．
     * このとき，何通りの買い方がありますか？ただし，含まれない食材があってもよいものとします
     *
     * @param n
     * @param r
     * @return
     */
    long homogeneousProduct(int n, int r) {
        return combination((n - 1) + r, r);
    }

    /**
     * 多項係数
     * 文字aをp個,bをq個,cをr個, dをs個 あわせてn個を1列に並べるときの並べ方
     * n! / p!・q!・r!・s!
     *
     * @param n
     * @param strNum
     * @param mod
     * @return
     */

    /**
     * フェルマーの小定理を用いて逆元を求める。
     * ある数xのmod p（pは素数）の逆数x'はx' = x^(p-2)
     * 繰り返し二乗法を用いて計算する。
     * http://satanic0258.hatenablog.com/entry/2016/04/29/004730
     * {@link BigInteger#modInverse(BigInteger)}とどちらが速いか？
     *
     * @param x
     * @return
     */
    private long modInverse(long x, long mod) {
        long res = 1L;
        long k = mod - 2L;
        long y = x;
        while (k != 0) {
            if (k % 2 != 0) {
                res = (res * y) % mod;
            }
            y = (y * y) % mod;
            k /= 2;
        }
        return res;
    }

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    }

    public boolean hasNext() {
        skipUnprintable();
        return hasNextByte();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public long min(long... v) {
        long min = Long.MAX_VALUE;
        for (long i : v) min = Math.min(min, i);
        return min;
    }

    public long max(long... v) {
        long max = Long.MIN_VALUE;
        for (long i : v) max = Math.max(max, i);
        return max;
    }
}


Measured memory_bytes: 33736