You are given an array arr with indices numbered from 1 to N.

You will be given Q queries of the form i X. This query means, consider all arr[i], arr[i+1], .. arr[N] and, among these numbers, output the number of multiples of X.

Input:

First line consists of two integers; N and Q.

Next Q lines consist of one query, as described in the problem statement.

How to compare two dates from input box using javascript?

Efficient way to find word from file in directory?
However directory contains huge number of files

What is mean by taking "build"? And Which processes and modules of an application involved while taking Builds.

Why spring is considered as light weight & why EJB is heavy weight?