#include <stdio.h>
#include <iostream>

long combination( int n, int r ) {
  if ( r > n-r ) return combination( n, n - r );
  long ans = 1;
  for ( int i = 1; i <= r; i++ ) {
    ans = ans * ( n - i + 1 ) / i;
  }
  return ans;
}   

int main( void )
{
  int K, S;
  std::cin >> K >> S;

  long count = 0;
  for ( int i = 2; S / i >= K; i++ ) {
    int original = i;
    int divisors = 0;
    int unique_divisors = 0;
    for ( int j = 2; j <= i; j++ ) {
      if ( original % j == 0 ) {
	unique_divisors++;
	while( original % j == 0 ) {
	  original /= j;
	  divisors++;
	}
      }
    }
    if ( divisors == unique_divisors ) {
      if ( divisors % 2 == 1 ) {
	count += combination( S / i, K );
      } else {
	count -= combination( S / i, K );
      }
    }	
  }

  if ( count > 10000 ) {
    std::cout << 10000 << std::endl;
  } else {
    std::cout << count << std::endl;
  }

  return 0;
}