#include <bits/stdc++.h>

#define int long long
#define lowbit(x) ((x) & (-x))
#define rep(i, s, t, st) for (int i = s, __##i = t; i <= __##i; i += st)
#define per(i, s, t, st) for (int i = s, __##i = t; i >= __##i; i -= st)
#define gc getchar
#define lc(x) ((x) << 1)
#define rc(x) (((x) << 1) | 1)
#define pll pair<int, int>
#define clr(pst, siz) memset(pst, 0, sizeof(int) * siz)
#define cpy(pst, tar, siz) memcpy(pst, tar, sizeof(int) * siz)

inline int read()
{
  int x = 0, f = 1, ch = gc();
  while (!isdigit(ch))
  {
    if (ch == '-')
      f = -f;
    ch = gc();
  }
  while (isdigit(ch))
  {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = gc();
  }
  return x * f;
}
inline void write(int x)
{
  if (x < 0)
    putchar('-'), x = -x;
  if (x / 10)
    write(x / 10);
  putchar('0' + x % 10);
}

using namespace std;

const int MAXN = 2e5 + 10;
const int MAXM = 2e5 + 10;
const int MAXQ = 2e5 + 10;
int n, m, q, c, d;
int a[MAXN], b[MAXN];
int g, tx, ty;
void extGcd(int a, int b, int &d, int &x, int &y)
{
  if (!b)
    d = a, x = 1, y = 0;
  else
  {
    extGcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}

signed main()
{
#ifndef ONLINE_JUDGE
  freopen("multi.in", "r", stdin);
  freopen("multi.out", "w", stdout);
#endif
  n = read(), m = read(), q = read();
  rep(i, 0, n, 1)
      a[i] = read();
  rep(i, 0, n, 1)
      b[i] = read();
  while (q--)
  {
    c = read(), d = read();
    int ans = 0;
    extGcd(c, d, g, tx, ty);
    if (m % g)
    {
      puts("0");
      continue;
    }
    tx *= m / g, ty *= m / g;
    int sx = d / g, sy = c / g;
    int t_min = ceil(-1.0 * tx / sx);
    int t_max = floor(1.0 * ty / sy);
    bool flag = false;
    rep(t, t_min, t_max, 1)
    {
      int x = tx + sx * t;
      int y = ty - sy * t;
      if (x >= 0 && y >= 0)
      {
        ans += a[x] * b[y];
        flag = true;
      }
    }
    write(ans), puts("");
  }
  return 0;
}