Let's consider a table consisting of n rows and n columns. The cell located at the intersection of i-th row and j-th column contains numberi × j. The rows and columns are numbered starting from 1.

You are given a positive integer x. Your task is to count the number of cells in a table that contain number x.

The single line contains numbers n and x (1 ≤ n ≤ 105, 1 ≤ x ≤ 109) — the size of the table and the number that we are looking for in the table.

Print a single number: the number of times x occurs in the table.

A table for the second sample test is given below. The occurrences of number 12 are marked bold.

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <iostream>

 using namespace std;

 #define ll long long

 int main()

 {

     ll n,x;

     while(cin>>n>>x){

         int s=;

         for(ll i=;i<=n;i++){

             if(x%i==&&x<=i*n) s++;

         }

         cout<<s<<endl;

     }

     return ;

 }