import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	long dfs(long[][] dp, int num, int v, long prd, long K) {
		long ret=0;
		if (num>=3) return dp[v][(int)(K/prd)];
		for (int i=v;i>20;--i) {
			ret+=dfs(dp, num+1, i-1, prd*i, K);
		}
		return ret;
	}
	
	void run() {
		FastScanner sc = new FastScanner();
		
		int N=sc.nextInt();
		long K=sc.nextLong();
		
		long ans=0;
		
		long[][] dp=new long[201][(int)1.1e5];

		{
			dp[0][1]=1;
			for (int i=1;i<=200;++i) {
				dp[i]=Arrays.copyOf(dp[i-1], dp[i-1].length);
				for (int j=1;j<dp[i-1].length;++j) {
					if (j*i<dp[i].length) dp[i][j*i]+=dp[i-1][j];
				}
			}
			for (int i=0;i<=200;++i) {
				for (int j=1;j<dp[i].length;++j) {
					dp[i][j]+=dp[i][j-1];
				}
			}
		}
		int max=Math.min(N, 20);
		for (int s=0;s<1<<max;++s) {
			long prd=1;
			for (int i=0;i<max;++i) {
				if ((s>>i)%2==1) {
					prd*=i+1;
				}
			}
			if (prd<=K) ++ans;
			ans += Math.max(0, Math.min(N, K/prd)-20);
			long n=N;
			for (int m=21;m<=N;++m) {
				n=Math.min(N, K/m/prd);
				if (m>=n) break;
				ans += n-m;
			}
		}
		ans+=dfs(dp, 0, N, 1, K);
		System.out.println(ans-1);
 	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	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;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	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 int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

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