跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0637. Powerful array

  • ID: 643
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 数据结构
  • 模拟
  • 数学
  • 双指针
  • 编程与模拟
  • 算法思想
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Powerful array

题目描述

D. Powerful array
time limit per test
5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

An array of positive integers a1,a2,...,an is given. Let us consider its arbitrary subarray al,al+1...,ar, where 1≤l≤r≤n. For every positive integer s denote by Ks the number of occurrences of s into the subarray. We call the power of the subarray the sum of products Ks·Ks·s for every positive integer s. The sum contains only finite number of nonzero summands as the number of different values in the array is indeed finite.

You should calculate the power of t given subarrays.

Input

First line contains two integers n and t (1≤n,t≤200000) − the array length and the number of queries correspondingly.

Second line contains n positive integers ai (1≤ai≤106) − the elements of the array.

Next t lines contain two positive integers l, r (1≤l≤r≤n) each − the indices of the left and the right ends of the corresponding subarray.

Output

Output t lines, the i-th line of the output should contain single positive integer − the power of the i-th query subarray.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preferred to use cout stream (also you may use %I64d).

Examples
Input
3 2
1 2 1
1 2
1 3

Output
3
6
Input
8 3
1 1 2 2 1 3 1 1
2 7
1 6
2 7
Output
20
20
20
Note

Consider the following array (see the second sample) and its [2, 7] subarray (elements of the subarray are colored):

Then K1=3, K2=2, K3=1, so the power is equal to 32·1+22·2+12·3=20.

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 47 题。保留原作者与原赛事署名。