9 10
6 2 3 1 4 8 5 9 8
3 9
6 6
9 9
9 9
9 9
2 3
3 9
3 8
6 9
5 6
 10 10
5 10 9 2 9 3 5 5 6 5
5 10
2 2
3 10
4 8
1 3
1 5
5 5
10 10
8 9
6 10
 8 10
100 100 100 100 100 100 100 100
1 8
2 8
3 8
4 8
5 8
6 8
7 8
8 8
1 1
1 5
 5 15
103 45 103 67 45
1 1
1 2
1 3
1 4
1 5
2 2
2 3
2 4
2 5
3 3
3 4
3 5
4 4
4 5
5 5
 1 1
1000000
1 1
 10 5
10 9 8 7 6 5 4 3 2 1
4 8
1 10
3 9
2 2
5 10
 9 10
5 3 10 2 4 8 7 5 1
6 9
1 8
3 3
2 7
3 5
4 6
9 9
8 8
1 9
5 6
 9 10
10 2 6 2 4 6 6 4 1
4 8
8 9
2 3
8 9
9 9
4 5
1 7
6 6
6 8
1 1
 20 8
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2
4 15
1 2
2 20
7 7
13 18
7 7
3 19
3 8
 1 2
1
1 1
1 1
 8 10
5 7 3 1 4 2 1 1
5 7
3 8
2 7
4 8
4 5
2 8
4 6
1 2
4 7
3 5

54
8
8
8
8
5
54
30
46
12
 63
10
92
34
24
53
9
5
11
54
 6400
4900
3600
2500
1600
900
400
100
100
2500
 103
148
457
524
659
45
148
215
350
103
170
215
67
112
45
 1000000
 25
55
35
9
21
 21
54
10
34
16
14
1
5
55
12
 42
5
8
5
1
6
76
6
28
10
 108
3
281
1
27
1
209
27
 1
1
 7
18
20
15
5
25
7
12
10
8

// Created by Whiplash99
import java.io.*;
import java.util.*;
public class A
{
    private static int S;

    static class Pair
    {
        int L, R, pos;
        long ans;

        Pair(int L, int R, int pos)
        {
            this.L = L;
            this.R = R;
            this.pos = pos;
            ans = 0;
        }
//        public int compareTo(Pair p)
//        {
//            if(this.L /S<p.L /S)
//                return -1;
//            else if(this.L /S>p.L /S)
//                return 1;
//            else
//                return (this.R <p.R)?-1:1;
//        }
    }

    private static void solve(long a[], int N, long max, int Q, ArrayList<Pair> query)
    {
        int cur_l, cur_r;
        long ans = 0;

        cur_l = cur_r = query.get(0).L;
        long freq[] = new long[(int) max + 5];
        freq[(int) a[cur_l]]++;
        ans += a[cur_l];

        for (int i = 0; i < Q; i++)
        {
            while (cur_l > query.get(i).L)
            {
                cur_l--;
                long num = a[cur_l];
                long f = freq[(int) (a[cur_l])];
                ans += 2 * num * f + num;
                freq[(int) (a[cur_l])]++;
            }
            while (cur_r < query.get(i).R)
            {
                cur_r++;
                long num = a[cur_r];
                long f = freq[(int) (a[cur_r])];
                ans += 2 * num * f + num;
                freq[(int) (a[cur_r])]++;
            }
            while (cur_l < query.get(i).L)
            {
                cur_l++;
                long num = a[cur_l - 1];
                long f = freq[(int) (a[cur_l - 1])];
                ans += num;
                ans -= 2 * num * f;
                freq[(int) (a[cur_l - 1])]--;
            }
            while (cur_r > query.get(i).R)
            {
                cur_r--;
                long num = a[cur_r + 1];
                long f = freq[(int) (a[cur_r + 1])];
                ans += num;
                ans -= 2 * num * f;
                freq[(int) (a[cur_r + 1])]--;
            }

            query.get(i).ans = ans;
        }
    }

    public static void main(String[] args) throws IOException
    {
        Reader br = new Reader();

        int i, N;

        N = br.nextInt();
        S = (int) (Math.sqrt(N)) + 1;
        int Q = br.nextInt();

        long a[] = new long[N];
        long max = 0;
        for (i = 0; i < N; i++)
        {
            a[i] = br.nextInt();
            max = Math.max(max, a[i]);
        }

        ArrayList<Pair> query = new ArrayList<>();
        for (i = 0; i < Q; i++)
        {
            int l = br.nextInt() - 1;
            int r = br.nextInt() - 1;

            query.add(new Pair(l, r, i));
        }


        try
        {
            Collections.sort(query, new Comparator<Pair>()
            {
                @Override
                public int compare(Pair o1, Pair o2)
                {
                    if (o1.L / S < o2.L / S)
                        return -1;
                    else if (o1.L / S > o2.L / S)
                        return 1;
                    else
                        return Integer.compare(o1.R, o2.R);
                }
            });
        }
        catch (Exception e)
        {
            
        }

        solve(a, N, max, Q, query);

        Collections.sort(query, (Pair x, Pair y) -> (x.pos - y.pos));
        StringBuilder sb = new StringBuilder();

        for (i = 0; i < Q; i++)
            sb.append(query.get(i).ans).append("\n");

        System.out.println(sb);
    }
    static class Reader {
            final private int BUFFER_SIZE = 1 << 16;private DataInputStream din;private byte[] buffer;private int bufferPointer, bytesRead;
            public Reader(){din=new DataInputStream(System.in);buffer=new byte[BUFFER_SIZE];bufferPointer=bytesRead=0;
            }public Reader(String file_name) throws IOException{din=new DataInputStream(new FileInputStream(file_name));buffer=new byte[BUFFER_SIZE];bufferPointer=bytesRead=0;
            }public String readLine() throws IOException{byte[] buf=new byte[64];int cnt=0,c;while((c=read())!=-1){if(c=='\n')break;buf[cnt++]=(byte)c;}return new String(buf,0,cnt);
            }public int nextInt() throws IOException{int ret=0;byte c=read();while(c<=' ')c=read();boolean neg=(c=='-');if(neg)c=read();do{ret=ret*10+c-'0';}while((c=read())>='0'&&c<='9');if(neg)return -ret;return ret;
            }public long nextLong() throws IOException{long ret=0;byte c=read();while(c<=' ')c=read();boolean neg=(c=='-');if(neg)c=read();do{ret=ret*10+c-'0';}while((c=read())>='0'&&c<='9');if(neg)return -ret;return ret;
            }public double nextDouble() throws IOException{double ret=0,div=1;byte c=read();while(c<=' ')c=read();boolean neg=(c=='-');if(neg)c = read();do {ret=ret*10+c-'0';}while((c=read())>='0'&&c<='9');if(c=='.')while((c=read())>='0'&&c<='9')ret+=(c-'0')/(div*=10);if(neg)return -ret;return ret;
            }private void fillBuffer() throws IOException{bytesRead=din.read(buffer,bufferPointer=0,BUFFER_SIZE);if(bytesRead==-1)buffer[0]=-1;
            }private byte read() throws IOException{if(bufferPointer==bytesRead)fillBuffer();return buffer[bufferPointer++];
            }public void close() throws IOException{if(din==null) return;din.close();}
        }
}
