Problem:
String Search

Determine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.

Input

In the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.

Output

For each question, print 1 if the text includes P_i, or print 0 otherwise.

Constraints

1 ≤ length of T ≤ 1000000

1 ≤ length of P_i ≤ 1000

1 ≤ Q ≤ 10000

The input consists of alphabetical characters and digits

Sample Input 1

aabaaa
4
aa
ba
bb
xyz

Sample Output 1

1
1
0
0

Solution in Ruby (judge verdict: Time Limit Exceeded)

t = gets.chomp
q = gets.to_i
p = []
min = 1.0 / 0.0
max = 0
q.times{|i|
  p[i] = gets.chomp
  min = p[i].size if p[i].size < min
  max = p[i].size if p[i].size > max
}

hash = {}
0.upto(t.size-min){|i|
  hash[t[i,min]] = [] unless hash[t[i,min]]
  hash[t[i,min]] << i
}

checked = {}
p.size.times{|i|
  unless checked[p[i]]
    unless hash[p[i][0,min]] then
      checked[p[i]] = 0
    else
      ans = 0
      hash[p[i][0,min]].each{|j|
        if t[j,p[i].size] == p[i] then
          ans = 1
          break
        end
      }
      checked[p[i]] = ans
    end
  end
  puts checked[p[i]]
}