description: This version of the problem differs from the next one only in the constraint on n.
  
  Note that the memory limit in this problem is lower than in others.
  
  You have a vertical strip with n cells, numbered consecutively from 1 to n from top to bottom.
  
  You also have a token that is initially placed in cell n. You will move the token up until it arrives at cell 1.
  
  Let the token be in cell x > 1 at some moment. One shift of the token can have either of the following kinds: 
  
    * Subtraction: you choose an integer y between 1 and x-1, inclusive, and move the token from cell x to cell x - y. 
    * Floored division: you choose an integer z between 2 and x, inclusive, and move the token from cell x to cell ⌊ x/z ⌋ (x divided by z rounded down). 
  
  
  
  Find the number of ways to move the token from cell n to cell 1 using one or more shifts, and print it modulo m. Note that if there are several ways to move the token from one cell to another in one shift, all these ways are considered distinct (check example explanation for a better understanding).
  
  Input
  
  The only line contains two integers n and m (2 ≤ n ≤ 2 ⋅ 10^5; 10^8 < m < 10^9; m is a prime number) — the length of the strip and the modulo.
  
  Output
  
  Print the number of ways to move the token from cell n to cell 1, modulo m.
  
  Examples
  
  Input
  
  
  3 998244353
  
  
  Output
  
  
  5
  
  
  Input
  
  
  5 998244353
  
  
  Output
  
  
  25
  
  
  Input
  
  
  42 998244353
  
  
  Output
  
  
  793019428
  
  Note
  
  In the first test, there are three ways to move the token from cell 3 to cell 1 in one shift: using subtraction of y = 2, or using division by z = 2 or z = 3.
  
  There are also two ways to move the token from cell 3 to cell 1 via cell 2: first subtract y = 1, and then either subtract y = 1 again or divide by z = 2.
  
  Therefore, there are five ways in total.
solution: import java.util.*;
  import java.io.*;
  
  public class Main {
  
      static long startTime = System.currentTimeMillis();
  
      // for global initializations and methods starts here
  
      // global initialisations and methods end here
  
      static void run() {
          boolean tc = false;
          AdityaFastIO r = new AdityaFastIO();
          //FastReader r = new FastReader();
  
          try (OutputStream out = new BufferedOutputStream(System.out)) {
  
              //long startTime = System.currentTimeMillis();
  
              int testcases = tc ? r.ni() : 1;
              int tcCounter = 1;
              // Hold Here Sparky------------------->>>
              // Solution Starts Here
  
              start:
              while (testcases-- > 0) {
  
                  int n = r.ni();
                  int mod = r.ni();
  
                  int[] dp = new int[n + 2];
                  int[] temp = new int[n + 2];
                  dp[n] = temp[n] = 1;
                  for (int i = n - 1; i > 0; i--) {
                      dp[i] = temp[i + 1];
                      for (int j = 2; i * j <= n; j++) {
                          int ind = Math.min(n + 1, (i + 1) * j);
                          dp[i] = ((dp[i] + temp[i * j]) % mod - temp[ind] + mod) % mod;
                      }
                      temp[i] = (temp[i + 1] + dp[i]) % mod;
                  }
  
                  out.write((dp[1] + " ").getBytes());
              }
              // Solution Ends Here
          } catch (IOException e) {
              e.printStackTrace();
          }
      }
  
      static class AdityaFastIO {
          final private int BUFFER_SIZE = 1 << 16;
          private final DataInputStream din;
          private final byte[] buffer;
          private int bufferPointer, bytesRead;
          public BufferedReader br;
          public StringTokenizer st;
  
          public AdityaFastIO() {
              br = new BufferedReader(new InputStreamReader(System.in));
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public AdityaFastIO(String file_name) throws IOException {
              din = new DataInputStream(new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public String word() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          public String line() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          public String readLine() throws IOException {
              byte[] buf = new byte[100000001]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1) {
                  if (c == '\n') break;
                  buf[cnt++] = (byte) c;
              }
              return new String(buf, 0, cnt);
          }
  
          public int ni() throws IOException {
              int ret = 0;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (neg) return -ret;
              return ret;
          }
  
          public long nl() throws IOException {
              long ret = 0;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (neg) return -ret;
              return ret;
          }
  
          public double nd() throws IOException {
              double ret = 0, div = 1;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
              if (neg) return -ret;
              return ret;
          }
  
          private void fillBuffer() throws IOException {
              bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
              if (bytesRead == -1) buffer[0] = -1;
          }
  
          private byte read() throws IOException {
              if (bufferPointer == bytesRead) fillBuffer();
              return buffer[bufferPointer++];
          }
  
          public void close() throws IOException {
              if (din == null) return;
              din.close();
          }
      }
  
      public static void main(String[] args) throws Exception {
          run();
      }
  
      static long mod = 998244353;
  
      static long modInv(long base, long e) {
          long result = 1;
          base %= mod;
          while (e > 0) {
              if ((e & 1) > 0) result = result * base % mod;
              base = base * base % mod;
              e >>= 1;
          }
          return result;
      }
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String word() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          String line() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          int ni() {
              return Integer.parseInt(word());
          }
  
          long nl() {
              return Long.parseLong(word());
          }
  
          double nd() {
              return Double.parseDouble(word());
          }
      }
  
      static int MOD = (int) (1e9 + 7);
  
      static long powerLL(long x, long n) {
          long result = 1;
          while (n > 0) {
              if (n % 2 == 1) result = result * x % MOD;
              n = n / 2;
              x = x * x % MOD;
          }
          return result;
      }
  
      static long powerStrings(int i1, int i2) {
          String sa = String.valueOf(i1);
          String sb = String.valueOf(i2);
          long a = 0, b = 0;
          for (int i = 0; i < sa.length(); i++) a = (a * 10 + (sa.charAt(i) - '0')) % MOD;
          for (int i = 0; i < sb.length(); i++) b = (b * 10 + (sb.charAt(i) - '0')) % (MOD - 1);
          return powerLL(a, b);
      }
  
      static long gcd(long a, long b) {
          if (a == 0) return b;
          else return gcd(b % a, a);
      }
  
      static long lcm(long a, long b) {
          return (a * b) / gcd(a, b);
      }
  
      static long lower_bound(List<Long> list, long k) {
          int s = 0;
          int e = list.size();
          while (s != e) {
              int mid = (s + e) >> 1;
              if (list.get(mid) < k) s = mid + 1;
              else e = mid;
          }
          if (s == list.size()) return -1;
          return s;
      }
  
      static int upper_bound(List<Long> list, long k) {
          int s = 0;
          int e = list.size();
          while (s != e) {
              int mid = (s + e) >> 1;
              if (list.get(mid) <= k) s = mid + 1;
              else e = mid;
          }
          if (s == list.size()) return -1;
          return s;
      }
  
      static void addEdge(ArrayList<ArrayList<Integer>> graph, int edge1, int edge2) {
          graph.get(edge1).add(edge2);
          graph.get(edge2).add(edge1);
      }
  
      public static class Pair implements Comparable<Pair> {
          int first;
          int second;
  
          public Pair(int first, int second) {
              this.first = first;
              this.second = second;
          }
  
          public String toString() {
              return "(" + first + "," + second + ")";
          }
  
          public int compareTo(Pair o) {
              // TODO Auto-generated method stub
              if (this.first != o.first)
                  return (int) (this.first - o.first);
              else return (int) (this.second - o.second);
          }
      }
  
      public static class PairC<X, Y> implements Comparable<PairC> {
          X first;
          Y second;
  
          public PairC(X first, Y second) {
              this.first = first;
              this.second = second;
          }
  
          public String toString() {
              return "(" + first + "," + second + ")";
          }
  
          public int compareTo(PairC o) {
              // TODO Auto-generated method stub
              return o.compareTo((PairC) first);
          }
      }
  
      static boolean isCollectionsSorted(List<Long> list) {
          if (list.size() == 0 || list.size() == 1) return true;
          for (int i = 1; i < list.size(); i++) if (list.get(i) <= list.get(i - 1)) return false;
          return true;
      }
  
      static boolean isCollectionsSortedReverseOrder(List<Long> list) {
          if (list.size() == 0 || list.size() == 1) return true;
          for (int i = 1; i < list.size(); i++) if (list.get(i) >= list.get(i - 1)) return false;
          return true;
      }
  
  }