B'While Vasya finished eating his piece of pizza, the lesson has already started. For being late for the lesson, the teacher suggested Vasya to solve one interesting problem. Vasya has an array a and integer x. He should find the number of different ordered pairs of indexes (i, xe2 x80 x89j) such that ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89aj and there are exactly k integers y such that ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89y xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89aj and y is divisible by x. In this problem it is meant that pair (i, xe2 x80 x89j) is equal to (j, xe2 x80 x89i) only if i is equal to j. For example pair (1, xe2 x80 x892) is not the same as (2, xe2 x80 x891). The first line contains 3 integers n, xe2 x80 x89x, xe2 x80 x89k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109, xe2 x80 x890 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109), where n is the size of the array a and x and k are numbers from the statement. The second line contains n integers ai (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the elements of the array a. Print one integer -- the answer to the problem. In first sample there are only three suitable pairs of indexes -- (1, xe2 x80 x892), xe2 x80 x89(2, xe2 x80 x893), xe2 x80 x89(3, xe2 x80 x894). In second sample there are four suitable pairs of indexes(1, xe2 x80 x891), xe2 x80 x89(2, xe2 x80 x892), xe2 x80 x89(3, xe2 x80 x893), xe2 x80 x89(4, xe2 x80 x894). In third sample every pair (i, xe2 x80 x89j) is suitable, so the answer is 5 xe2 x80 x89* xe2 x80 x895 xe2 x80 x89= xe2 x80 x8925. '...