CF111B Petya and Divisors

Little Petya loves looking for numbers' divisors. One day Petya came across the following problem: You are given $ n $ queries in the form " $ x_{i} $ $ y_{i} $ ". For each query Petya should count how many divisors of number $ x_{i} $ divide none of the numbers $ x_{i-yi},x_{i-yi}+1,...,x_{i-1} $ . Help him.

The first line contains an integer $ n $ ( $ 1

For each query print the answer on a single line: the number of positive integers $ k $ such that 

Let's write out the divisors that give answers for the first 5 queries: 1\) 1, 2, 4 2\) 3 3\) 5 4\) 2, 6 5\) 9, 18