CF div2 319 A

A. Multiplication Table

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

The single line contains numbers n and x (1 ≤ n ≤ 10⁵, 1 ≤ x ≤ 10⁹) — 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.

Sample test(s)

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.

愚蠢的来了一发O（n^2）的暴力，简直太暴力了，后面发现直接枚举n就行了

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#include <stack>

using namespace std;

const int M = 10005;
const int maxn = 5000000;
typedef long long ll;

vector<int>G[maxn];
queue<int>Q;
stack<int>st;


int a[maxn];

int main()
{

   long long n,i;
    long long ans = 0;
    int cnt = 0;
    long long x;
    scanf("%lld%lld",&n,&x);
    for( i=1;i<=n;i++){
        if(x%i==0&&i!=1&&x/i<=n){
            ans++;
        }
    }
    if(n>=x) ans++;
     printf("%lld\n",ans);
    return 0;
}