object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N = ni()
    val S = ns(N)
    val Q = ni()
    val K = na(Q)

    def mkChars(c: Char): Array[Int] = {
      var p = 0
      rep(N) { i =>
        if (S(i) == c) p += 1
      }
      val res = Array.ofDim[Int](p)
      rep_r(N) { i =>
        if (S(i) == c) {
          p -= 1
          res(p) = i
        }
      }
      res
    }

    val cum = Array.ofDim[Int](N + 1)
    rep(N, 1) { i =>
      cum(i) = cum(i - 1)
      if (S(i - 1) == 'M') cum(i) += 1
    }

    def countM(l: Int, r: Int) = cum(r + 1) - cum(l)

    val L = mkChars('D')
    val R = mkChars('C')
    val minR: Array[Int] = { // todo Lに対して、L(i)の値よりも大きくなりRのmin
      val res = Array.ofDim[Int](L.length)
      var r = 0
      rep(L.length) { l =>
        while(r < R.length && L(l) > R(r)) r += 1
        res(l) = r
      }
      res
    }

    rep(Q) { i =>
      var ans = 0L
      val k = K(i)

      var sum = 0L
      var cnt = 0L
      var r = 0

      rep(L.length) { l =>
        if (minR(l) < R.length) {
          if (l > 0) {
            rep(minR(l) - minR(l - 1)) { i =>
              sum -= cnt * countM(R(minR(l - 1) + i), R(minR(l - 1) + i + 1))
              cnt -= 1
            }
            val len = if (minR(l) - minR(l - 1) == 0) {
              countM(L(l - 1), L(l))
            } else {
              countM(R(minR(l) - 1), L(l))
            }
            sum -= cnt * len
          }
          while (r < R.length && R(r) - L(l) < k) {
            sum += cum(R(r) + 1) - cum(L(l))
            cnt += 1
            r += 1
          }
          ans += sum
        }
      }
      out.println(ans)
    }
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    rep(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    rep(n) { i =>
      rep(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def rep(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def rep_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    rep(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    rep(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Int]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    rep(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}