SP11676 CPAIR2 - Counting diff-pairs

You are given sequence A of N integers. You are also given integer K and M queries. Each query consists of two integers l, r. For each query output number of pairs i, j such that l

First line of input contains integers N, M, K in this order. Second line contains N integers representing array A. Next M lines describe queries.

Output answer for each query.