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 number *i* × *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* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *x* ≤ 10<sup class="upper-index">9</sup>) — the size of the table and the number that we are looking for in the table.
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,x,res=0;
    cin>>n>>x;
    for(int i=1;i<=n;i++)
    {
        if(x%i==0 && x/i<=n)
        {
            res++;
        }
    }
    cout<<res;
}