#include <bits/stdc++.h>
using namespace std;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
const double EPS = 1e-8;
const double PI = acos(-1.0);
int popcount(int n) { return __builtin_popcount(n); }
int popcount(long long n) { return __builtin_popcountll(n); }
template <class T>
int SIZE(T a) {
  return a.size();
}
template <class T>
string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T>
T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - '0');
  return res;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
long long getTen(int a) { return (a <= 0) ? 1 : (getTen(a - 1) * 10); }
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0) res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}
int sums[100010];
int sums2[10][100010];
int ary[100010];
int N, K, W;
int main() {
  cin >> N >> K >> W;
  for (int i = 0; i < N; i++) {
    char ch;
    cin >> ch;
    if (ch == '1') ary[i] = 1;
  }
  for (int i = 0; i < N; i++) sums[i + 1] = sums[i] + ary[i];
  for (int i = 0; i < K; i++) {
    for (int j = i; j < N; j++) {
      sums2[i][j + 1] = sums2[i][j] + (((j - i) % K == 0) ? ary[j] : 0);
    }
  }
  for (int i = 0; i < W; i++) {
    int l, r;
    cin >> l >> r;
    l--;
    r--;
    int s = sums[r + 1] - sums[l];
    int c =
        sums2[(l % K + (K - 1)) % K][r + 1] - sums2[(l % K + (K - 1)) % K][l];
    int t = (1 + r - l) / K;
    int res = 0;
    res += t - c;
    res += (s - c);
    cout << res << endl;
  }
  return 0;
}
