Codeforces 577A - Multiplication Table

Posted 2020-09-29 午夜的行人

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.

Input

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.

Output

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

Examples

input

10 5

output

2

input

6 12

output

4

input

5 13

output

0

Note

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

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 #include <iostream>
 5 using namespace std;
 6 #define ll long long
 7 int main()
 8 {
 9     ll n,x;
10     while(cin>>n>>x){
11         int s=0;
12         for(ll i=1;i<=n;i++){
13             if(x%i==0&&x<=i*n) s++;
14         }
15         cout<<s<<endl;
16     }
17     return 0;
18 }