int main(){
    string s;
    cin >> s;
    int n;
    cin >> n;    
    vector<bool> vb(10*1000*1000);    
    int mul=1;
    char prev='1';
    for(int j=0; j<s.size(); j++){
        int w = s[j]-'a'+1;
        if(s[j]==prev) {mul++; w*=mul;}
        else mul=1;
        prev = s[j];
        vb[w] = true;
    }    
    for(int a0 = 0; a0 < n; a0++){
        int x;
        cin >> x;
        if(vb[x]) cout << "Yes" << endl;
        else cout << "No" << endl;
    }    
    return 0;
}

public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        int n = in.nextInt();
        char [] charArray = s.toCharArray();
        int contigentString = 1;
        int lastAlphaNum = 0;
        Set<Integer> numList = new HashSet<Integer>();
        for(int i=0 ;i< charArray.length; i ++){
            int alphaNum = charArray[i] -'a'+1;
            if(alphaNum == lastAlphaNum){
                contigentString++;
            }
            else{
                contigentString = 1;
                lastAlphaNum = alphaNum;
            }
            int num = (alphaNum) * contigentString;
            numList.add(num); 
        }
        for(int a0 = 0; a0 < n; a0++){
            int x = in.nextInt();
            if(numList.contains(x) ){
                System.out.println("Yes");
            }
            else{
                System.out.println("No");
            }
        }
    }

alpha = {'a':1, 'b':2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8, 'i':9, 'j':10, 'k':11, 'l':12, 'm':13, 'n':14, 'o':15, 'p':16, 'q':17, 'r':18, 's':19, 't':20, 'u':21, 'v':22, 'w':23, 'x':24, 'y':25, 'z':26}

s = input().strip()
n = int(input().strip())
scores = set()
ctr=1
for i in range(len(s)):
    score = alpha[s[i]]
    ctr = ctr+1 if (i+1 != len(s) and s[i+1] == s[i]) else 1
    scores.add(score*ctr)

for a0 in range(n):
    x = int(input().strip())
    print("Yes" if x in scores else "No")

weights = set(chain.from_iterable(imap(lambda (x, y): x * y, enumerate(g, 1)) for _, g in groupby(imap(lambda c: ord(c) - 96, raw_input()))))
for X in (input() for _ in xrange(input())):
    print ["No", "Yes"][X in weights]

#!/bin/python3
import sys
s = input().strip()
n = int(input().strip())
seq=[]
for num in range(1,27):
    seq.append(0)
for x in sorted(set(s)):
    i = 1;
    while x * i in s:
        i += 1
    seq[ord(x)-97]=i-1 
finale=[] 			     	         #using list
for index,every in enumerate(seq):
    for sval in range(every):
        finale.append((index+1)*(sval+1))  	 #using list 
for a0 in range(n):
    x = int(input().strip())
    print("Yes" if x in finale else "No")

#!/bin/python3
import sys
s = input().strip()
n = int(input().strip())
seq=[]
for num in range(1,27):
    seq.append(0)
for x in sorted(set(s)):
    i = 1;
    while x * i in s:
        i += 1
    seq[ord(x)-97]=i-1 
finale=set() 				#using set
for index,every in enumerate(seq):
    for sval in range(every):
        finale.add((index+1)*(sval+1)) 	#using set
for a0 in range(n):
    x = int(input().strip())
    print("Yes" if x in finale else "No")

import Foundation

let inputString = readLine()!

var input = Array(inputString.unicodeScalars.map { Int($0.value) })

for i in 0..<input.count {
    var c = input[i]
    let a = Int(UnicodeScalar("a").value)
    c -= a
    c += 1
    input[i] = c
}

let queryCount = Int(readLine()!)!

var maxSequence = [Int]()
for i in 0..<26 { maxSequence.append(0) }

var prevChar: Int = -1
var sequenceCount: Int = 0
    
for i in 0..<input.count {
    
    if prevChar == input[i] {
        sequenceCount += 1
    } else {
        sequenceCount = 1
    }
        
    if sequenceCount > maxSequence[input[i] - 1] {
        maxSequence[input[i] - 1] = sequenceCount
    }
    prevChar = input[i]
}

for _ in 0..<queryCount {
    var query = Int(readLine()!)!
    var collide = false
    var index: Int = 0
    
    while index < maxSequence.count && collide == false {
        var val = maxSequence[index]
        if val > 0 {
            let num: Int = (index + 1)
            
            //num * X = query
            var expected = query / num
            if expected * num == query && expected <= val {
                collide = true
            }
        }   
        index += 1
    }   
    print(collide ? "Yes" : "No")
}

// Complete the weightedUniformStrings function below.
function weightedUniformStrings(s, queries) {
    var code;
    var prevChar;
    var prevCharCount;
    var dic = Object.create(null);
    for (var i = 0; i < s.length; i++) {
        code = s.charCodeAt(i) - 96;
        if (prevChar === code) {
            prevCharCount++;
        } else {
            prevCharCount = 1;
            prevChar = code;
        }
        
        dic[code * prevCharCount] = true;
    }
    
    var result = [];
    for (var i = 0; i < queries.length; i++) {
        result.push(dic[queries[i]] ? "Yes" : "No");
    }
    
    return result;
}

public static void main(String[] args) {
         int i=0;
       Scanner in = new Scanner(System.in);
        String s = in.next();
        int n = in.nextInt();
        int sum=0;
        int num[]=new int[n];
        for(int a0 = 0; a0 < n; a0++)
            num[a0]=in.nextInt();
        
        for(int k=0;k<n;k++)
        {
            sum=s.charAt(0)-'a'+1;
            if(sum==num[k])
                {
                     System.out.println("Yes");
                     continue;
                }
            for(i=0;(i+1)<s.length();i++)
            {  
                if(s.charAt(i)==s.charAt(i+1))
                {
                    sum+=s.charAt(i)-'a'+1;
                }
                else sum=s.charAt(i+1)-'a'+1;
                if(sum==num[k])
                {
                     System.out.println("Yes");
                     break;
                } 
            }
            if((i+1)==s.length())
                System.out.println("No");
        }
        }

require 'set'
map, weights, counter = ('a'..'z').zip(1..26).to_h, Set.new, 1
s = gets.strip.chars.map{|c| map[c]}
for i in 0...s.length
    counter = (i > 0 and s[i] == s[i-1]) ? counter + 1 : 1
    weights.add counter * s[i] end
gets.strip.to_i.times do
    puts weights.include?(gets.strip.to_i) ? "Yes" : "No" end

#!/bin/python3

import sys


s = input().strip()
n = int(input().strip())

sorted(s)

a_set = set()
prev = ''

count = 0
for c in s:
    if c != prev:
        count = 1
        prev = c
    else:
        count +=1
    a_set.add(count * (ord(c) - 96))

for a0 in range(n):
    x = int(input().strip())
    print("Yes" if x in a_set else "No")