import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.TreeSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author ilyakor
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TreeSet<Integer>[] poses = new TreeSet[m];
            for (int i = 0; i < m; ++i)
                poses[i] = new TreeSet<>();
            int q = in.nextInt();
            int[] a = new int[q];
            for (int i = 0; i < q; ++i) {
                int x = in.nextInt() - 1;
                a[q - 1 - i] = x;
                poses[x].add(q - 1 - i);
            }
            int[] heads = new int[n];
            //int prev = -1;
            TreeSet<Integer> alive = new TreeSet<>();
            for (int i = 0; i < m; ++i)
                alive.add(i);
            for (int i = 0; i < q; ++i) {
                if (a[i] == -1) continue;
                int x = a[i];


                TreeSet<Integer> inds = poses[x];
                for (int j = 0; j < n; ++j) {
                    Integer ind = inds.ceiling(heads[j]);
                    if (ind == null) {
                        if (alive.isEmpty() || alive.first() != x) {
                            out.printLine("No");
                            return;
                        }
                        break;
                    }
                    heads[j] = ind;
                    a[ind] = -1;
                    inds.remove(ind);
                }
                for (int ind : inds) {
                    a[ind] = -1;
                }
                inds.clear();
                alive.remove(x);
                //prev = x;
            }
            out.printLine("Yes");
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buffer = new byte[10000];
        private int cur;
        private int count;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public static boolean isSpace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int read() {
            if (count == -1) {
                throw new InputMismatchException();
            }
            try {
                if (cur >= count) {
                    cur = 0;
                    count = stream.read(buffer);
                    if (count <= 0)
                        return -1;
                }
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            return buffer[cur++];
        }

        public int readSkipSpace() {
            int c;
            do {
                c = read();
            } while (isSpace(c));
            return c;
        }

        public int nextInt() {
            int sgn = 1;
            int c = readSkipSpace();
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res = res * 10 + c - '0';
                c = read();
            } while (!isSpace(c));
            res *= sgn;
            return res;
        }

    }
}



Measured memory_bytes: 45264