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: //Some of the methods are copied from GeeksforGeeks Website  
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  public class Main
  { 
    //static Scanner sc=new Scanner(System.in)
    static  Reader sc=new Reader();
    // static FastReader sc=new FastReader(System.in);
    
    static long mod = (long)(1e9)+ 7;
    static int max_num=(int)4e6+5;
  //  static int n;
    static long m;
    static long dp[];
    
    // Max tree size
    final static int MAX =max_num;
    static long  BITree[] = new long[MAX];
    
  static void updateBIT(int n, int index,  long val)
      {
          index = index + 1;
          while (index <= n+1)
          {
              BITree[index] = (BITree[index] % m + val % m ) % m;
              index += index & (-index);
          }
      }
      
    static void constructBITree(int n)
      {
          for(int i = 1; i <= n; i++)
              BITree[i] = 0;
      }
      
   static long getSum(int index)
      {
          long sum = 0; 
          index = index + 1;
          while (index > 0)
          {
              sum = ( sum % m + BITree[index] % m) % m;
              index -= index & (-index);
          }
          return sum;
      }
      
  static void update(int l, int r,int n, long val)
      {
          updateBIT(n, l, val);
          updateBIT(n, r + 1, -val);
      }
    
   public static void main (String[] args) throws java.lang.Exception
     {
  	try{
  		  int t = 1;//sc.nextInt();
  		  while(t-->0)
  		    { 
  		        int n=sc.nextInt();
  		        m=sc.nextLong();
  		        
  		        dp=new long[n+1];
  		        constructBITree(n);
  		        
  		        long pref=0;
  		        dp[1]=1l;
  		        
  		        for(int i=1;i<=n;i++)
  		          {
  		             if(i!=1)
  		              {
  		                dp[i]=getSum(i);
  		              }
  		              
  		             dp[i]=(dp[i] % m + pref % m ) % m;
  		             pref=(pref % m + dp[i] % m) % m;
  		             
  		             for (int j = 2;(i * j <= n);j++)
  		               {
                          //update range from i * j to min(n,j * i + j - 1) by +dp[i]
                          update(i * j,Math.min(n,j * i + j - 1),n,dp[i]);
  		                }
  		          }
  		          
  		      out.println((dp[n]+m)%m);
  		    }
  	     out.flush();
  	     out.close();
  	   }     
  	catch(Exception e)
  		 {}
  	}
   
   /*
     ...SOLUTION ENDS HERE...........SOLUTION ENDS HERE...
   */
   
  static void flag(boolean flag)
     {
         out.println(flag ? "YES" : "NO");
         out.flush();
     }
     
   /*                     
      Map<Long,Long> map=new HashMap<>();
               for(int i=0;i<n;i++)
                 {
                    if(!map.containsKey(a[i]))
                     map.put(a[i],1);
                   else
                     map.replace(a[i],map.get(a[i])+1);
                 }
       
      Set<Map.Entry<Long,Long>> hmap=map.entrySet();
               for(Map.Entry<Long,Long> data : hmap)
                 {
            
                 }
         
     */
     
  //  static class Pair
  //    {
  //       int x,y;
  //       Pair(int x,int y)
  //        {
  //           this.x=x;
  //           this.y=y;
  //        }
  //    }
  
  //  Arrays.sort(p, new Comparator<Pair>()
  //     {
  //        @Override
  //        public int compare(Pair o1,Pair o2)
  //        {
  //           if(o1.x>o2.x) return 1;
  //           else if(o1.x==o2.x)
  //             {
  //                if(o1.y>o2.y) return 1;
  //                else return -1;
  //              }
  //           else return -1;
  //       }});
  
  static void print(int a[])
    {
       int n=a.length;
       for(int i=0;i<n;i++)
         {
            out.print(a[i]+" ");
         }
       out.println();
       out.flush();
    }
  static void print(long a[])
    {
       int n=a.length;
       for(int i=0;i<n;i++)
         {
            out.print(a[i]+" ");
         }
       out.println();
       out.flush();
    } 
  static void print_int(ArrayList<Integer> al)
    {
       int si=al.size();
       for(int i=0;i<si;i++)
         {
            out.print(al.get(i)+" ");
         }
       out.println();
       out.flush();
    }
  static void print_long(ArrayList<Long> al)
    {
       int si=al.size();
       for(int i=0;i<si;i++)
         {
            out.print(al.get(i)+" ");
         }
       out.println();
       out.flush();
    }
    
  static int LowerBound(int a[], int x) 
   { // x is the target value or key
    int l=-1,r=a.length;
    while(l+1<r) {
      int m=(l+r)>>>1;
      if(a[m]>=x) r=m;
      else l=m;
    }
    return r;
  }
  
   static int UpperBound(int a[], int x)
    {// x is the key or target value
      int l=-1,r=a.length;
      while(l+1<r) {
         int m=(l+r)>>>1;
         if(a[m]<=x) l=m;
         else r=m;
      }
      return l+1;
   }
  static void DFS(ArrayList<Integer> graph[],boolean[] visited, int u)
  	{
          visited[u]=true;
          int v=0;
          for(int i=0;i<graph[u].size();i++)
          {
              v=graph[u].get(i);
              if(!visited[v])
                 DFS(graph,visited,v);
          }
    } 
  static boolean[] prime(int num)
   {
  	      boolean[] bool = new boolean[num];
  		     
  		      for (int i = 0; i< bool.length; i++) {
  		         bool[i] = true;
  		      }
  		      for (int i = 2; i< Math.sqrt(num); i++) {
  		         if(bool[i] == true) {
  		            for(int j = (i*i); j<num; j = j+i) {
  		               bool[j] = false;
  		            }
  		         }
  		      }
  		      if(num >= 0) {
  		    	  bool[0] = false;
  		    	  bool[1] = false;
  		      }
  		      
  		      return bool;
    }
  static long nCr(long a,long b,long mod)
  {
   return (((fact[(int)a] * modInverse(fact[(int)b],mod))%mod * modInverse(fact[(int)(a - b)],mod))%mod + mod)%mod;
  }
  static long fact[]=new long[max_num];
  static void fact_fill()
   {
     long fact[]=new long[max_num];
     fact[0]=1l;
  	for(int i=1;i<max_num;i++)
  	  {
  	    fact[i]=(fact[i-1]*(long)i);
  	    if(fact[i]>=mod)
  	      fact[i]%=mod;
  	  } 
   }
  static long modInverse(long a, long m)
  	    {
  	       return power(a, m - 2, m);
  	    }
  static long power(long x, long y, long m)
  	    {
  	        if (y == 0)
  	            return 1;
  	        long p = power(x, y / 2, m) % m;
  	        p = (long)((p * (long)p) % m);
  	        if (y % 2 == 0)
  	            return p;
  	        else
  	            return (long)((x * (long)p) % m);
  	    }
  static long sum_array(int a[])
   {
      int n=a.length;
      long sum=0;
      for(int i=0;i<n;i++)
       sum+=a[i];
      return sum;
   }
  static long sum_array(long a[])
   {
      int n=a.length;
      long sum=0;
      for(int i=0;i<n;i++)
       sum+=a[i];
      return sum;
   }
  
  static void sort(int[] a) 
     {
  		ArrayList<Integer> l=new ArrayList<>();
  		for (int i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
  	}
  static void sort(long[] a) 
     {
  		ArrayList<Long> l=new ArrayList<>();
  		for (long i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
  	}
  
  static void reverse_array(int a[])
   {
      int n=a.length;
      int i,t; 
      for (i = 0; i < n / 2; i++) { 
              t = a[i]; 
              a[i] = a[n - i - 1]; 
              a[n - i - 1] = t; 
          } 
   }
  static void reverse_array(long a[])
   {
      int n=a.length;
      int i; long t; 
      for (i = 0; i < n / 2; i++) { 
              t = a[i]; 
              a[i] = a[n - i - 1]; 
              a[n - i - 1] = t; 
          } 
   }
  
  static long gcd(long a, long b) 
      { 
          if (a == 0) 
              return b; 
            
          return gcd(b%a, a); 
      } 
  static int gcd(int a, int b) 
      { 
          if (a == 0) 
              return b; 
            
          return gcd(b%a, a); 
      } 
  
     static class FastReader{
   
          byte[] buf = new byte[2048];
          int index, total;
          InputStream in;
   
          FastReader(InputStream is) {
              in = is;
          }
   
          int scan() throws IOException {
              if (index >= total) {
                  index = 0;
                  total = in.read(buf);
                  if (total <= 0) {
                      return -1;
                  }
              }
              return buf[index++];
          }
   
          String next() throws IOException {
              int c;
              for (c = scan(); c <= 32; c = scan());
              StringBuilder sb = new StringBuilder();
              for (; c > 32; c = scan()) {
                  sb.append((char) c);
              }
              return sb.toString();
          }
   
          int nextInt() throws IOException {
              int c, val = 0;
              for (c = scan(); c <= 32; c = scan());
              boolean neg = c == '-';
              if (c == '-' || c == '+') {
                  c = scan();
              }
              for (; c >= '0' && c <= '9'; c = scan()) {
                  val = (val << 3) + (val << 1) + (c & 15);
              }
              return neg ? -val : val;
          }
   
          long nextLong() throws IOException {
              int c;
              long val = 0;
              for (c = scan(); c <= 32; c = scan());
              boolean neg = c == '-';
              if (c == '-' || c == '+') {
                  c = scan();
              }
              for (; c >= '0' && c <= '9'; c = scan()) {
                  val = (val << 3) + (val << 1) + (c & 15);
              }
              return neg ? -val : val;
          }
      }
     
      static class Reader 
      { 
          final private int BUFFER_SIZE = 1 << 16; 
          private DataInputStream din; 
          private byte[] buffer; 
          private int bufferPointer, bytesRead; 
    
          public Reader() 
          { 
              din = new DataInputStream(System.in); 
              buffer = new byte[BUFFER_SIZE]; 
              bufferPointer = bytesRead = 0; 
          } 
    
          public Reader(String file_name) throws IOException 
          { 
              din = new DataInputStream(new FileInputStream(file_name)); 
              buffer = new byte[BUFFER_SIZE]; 
              bufferPointer = bytesRead = 0; 
          } 
    
          public String readLine() throws IOException 
          { 
              byte[] buf = new byte[64]; // 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 nextInt() 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 nextLong() 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 nextDouble() 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(); 
          } 
      }
    static  PrintWriter out=new PrintWriter(System.out);
    static int int_max=Integer.MAX_VALUE;
    static int int_min=Integer.MIN_VALUE;
    static long long_max=Long.MAX_VALUE;
    static long long_min=Long.MIN_VALUE;
  }
  // Thank You !