// 忽略那一堆 default code 的怪模板
#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pii pair <int, int>
#define ll long long int
#define F first
#define S second
#define pq priority_queue
#define usll unsigned long long int
#define pb push_back
using namespace std;

bool first = true;
void solve (){
  int N, M;
  while (cin >> N >> M){
    vector <usll> vec(N+17, 0);
    vector <usll> presum(N+17, 0);
    for (int i = 1; i <= N; i++){
      cin >> vec[i];
      presum[i] = presum[i-1] + vec[i];
    }
    while (M--){
      int l, r; cin >> l >> r;
      cout << presum[r] - presum[l-1] << '\n';
    }
  }
}

int main (){
  icisc
  solve();
}

#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pii pair <int, int>
#define ll long long int
#define F first
#define S second
#define pq priority_queue
#define usll unsigned long long int
#define pb push_back
using namespace std;

void solve (){
  int N, M;
  while (cin >> N >> M){
    vector <vector <int> > graph(N+17, vector <int>(N+17, 0));
    vector <vector <int> > presum = graph;
    for (int i = 1; i <= N; i++) {
      for (int j = 1; j <= N; j++) {
        cin >> graph[i][j];
        presum[i][j] = graph[i][j] + presum[i-1][j] + presum[i][j-1] - presum[i-1][j-1];
      }
    }

    while (M--){
      int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey;
      cout << presum[ex][ey] - presum[sx-1][ey] - presum[ex][sy-1] + presum[sx-1][sy-1] << '\n';
    }
  }
}

int main (){
  icisc
  solve();
}

#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long int
#define usll unsigned long long int
#define pii pair <int, int>
#define F first
#define S second
#define pq priority_queue
#define pb push_back
using namespace std;

void solve (){
  int N, M; cin >> N >> M;
  vector <usll> vec(N);
  for (auto &to:vec) cin >> to;
  sort(vec.begin(), vec.end(), greater<int>());

  vector <usll> predif(N, 0); // 計算出現次數
  while (M--){
    int l, r; cin >> l >> r;
    l--;r--; // cuz input is 1-based
    predif[l]++;
    if (r+1 < N) predif[r+1]--;
  }

  vector <usll> tmp = predif; //差分做前綴和來還原
  for (int i = 1; i < N; i++) tmp[i] += tmp[i-1];
  // for (auto to:tmp) cout << to << ' ';
  sort(tmp.begin(), tmp.end(), greater<int>());

  usll count = 0;
  for (int i = 0; i < N; i++) count += vec[i]*tmp[i];
  cout << count << '\n';
}

int main (){
  icisc
  solve();
}

#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long int
using namespace std;

ll Mod (ll n, ll m){
  return (n+m) % m;
}

ll Mult (ll a, ll b, ll m){
  return Mod(Mod(a, m) * Mod(b, m), m);
}

ll bipow (ll a, ll b, ll m){
  if (b == 0) return 1;
  if (b == 1) return a;
  if (b&1) return Mult(a, bipow(a, b-1, m), m);
  ll tmp = bipow(a, b/2, m);
  return Mult(tmp, tmp, m);
}

void solve (){
  int N; cin >> N;
  while (N--){
    int a, b; cin >> a >> b;
    cout << bipow(a, b, 10) << '\n';
  }
}

int main (){
  icisc
  solve();
}

#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long int
#define usll unsigned long long int
#define pii pair <int, int>
#define F first
#define S second
#define pq priority_queue
#define pb push_back
using namespace std;

ll Mod (ll n, ll m){
  return (n+m) % m;
}

ll Mult (ll a, ll b, ll m){
  return Mod(Mod(a, m) * Mod(b, m), m);
}

ll bipow (ll a, ll b, ll m){
  if (b == 0) return 1;
  if (b&1) return Mult(a, bipow(a, b-1, m), m);
  ll tmp = bipow(a, b/2, m);
  return Mult(tmp, tmp, m);
}

void solve (){
  ll x, y, p; cin >> x >> y >> p;
  cout << bipow(x, y, p) << '\n';
}

int main (){
  icisc
  solve();
}

#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long int
using namespace std;

const int MOD = 1e9 + 7;

ll Mod (ll n, ll m){
  return (n+m) % m;
}

ll Mult (ll a, ll b, ll m){
  return Mod(Mod(a, m) * Mod(b, m), m);
}

ll bipow (ll a, ll b, ll m){
  if (b == 0) return 1;
  if (b == 1) return a;
  if (b&1) return Mult(a, bipow(a, b-1, m), m);
  ll tmp = bipow(a, b/2, m);
  return Mult(tmp, tmp, m);
}

void solve (){
  int N; cin >> N;
  while (N--){
    ll num; cin >> num;
    if (num == 1) cout << "1\n";
    else if (num == 2) cout << "2\n";
    else if (num == 3) cout << "3\n";
    else if (num%3 == 0) cout << bipow(3, num/3, MOD) << '\n';
    else if (num%3 == 1) cout << Mult(4, bipow(3, (num-4)/3, MOD), MOD) << '\n';
    else cout << Mult(2, bipow(3, (num-2)/3, MOD), MOD) << '\n';
  }
}

int main (){
  icisc
  solve();
}

#include <bits/stdc++.h>
#define icisc ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long int
#define usll unsigned long long int
#define pii pair <int, int>
#define F first
#define S second
#define pq priority_queue
#define pb push_back
using namespace std;

vector <vector <ll>> matrix_mult (vector <vector <ll>> a, vector <vector <ll>> b){
  int ax = a[0].size(), ay = a.size(); // x 表行數，y 表列數
  int bx = b[0].size(), by = b.size(); // x 表行數，y 表列數
  if (ax == by) { //a 的行數必須等於 b 的列數
    vector <vector <ll>> ret(ay, vector <ll>(bx, 0));
    for (int i = 0; i < ay; i++){ // 直的跑
      for (int j = 0; j < bx; j++){ // 橫的跑
        for (int k = 0; k < ax; k++){ // 負責計算
          ret[i][j] += a[i][k] * b[k][j];
        }
      }
    }
    return ret;
  }else{
    cout << "Error\n";
    return vector <vector <ll>>();
  }
}

void solve (){
  int a, b, c, d;
  while (cin >> a >> b >> c >> d){
    if (b != c){
      cout << "Error\n";
      continue;
    }

    vector <vector <ll>> matrix_a(a, vector <ll>(b, 0));
    vector <vector <ll>> matrix_b(c, vector <ll>(d, 0));
    for (int i = 0; i < a; i++)
      for (int j = 0; j < b; j++)
        cin >> matrix_a[i][j];
    for (int i = 0; i < c; i++)
      for (int j = 0; j < d; j++)
        cin >> matrix_b[i][j];

    vector <vector <ll>> ans = matrix_mult(matrix_a, matrix_b);
    for (int i = 0; i < a; i++) {
      for (int j = 0; j < d; j++) {
        cout << ans[i][j] << ' ';
      }
      cout << '\n';
    }
  }
}

int main (){
  icisc
  solve();
}