Problem: Some days ago, WJMZBMR learned how to answer the query "how many times does a string x occur in a string s" quickly by preprocessing the string s. But now he wants to make it harder.

So he wants to ask "how many consecutive substrings of s are cyclical isomorphic to a given string x". You are given string s and n strings xi, for each string xi find, how many consecutive substrings of s are cyclical isomorphic to xi.

Two strings are called cyclical isomorphic if one can rotate one string to get the other one. 'Rotate' here means 'to take some consecutive chars (maybe none) from the beginning of a string and put them back at the end of the string in the same order'. For example, string "abcde" can be rotated to string "deabc". We can take characters "abc" from the beginning and put them at the end of "de".

Input

The first line contains a non-empty string s. The length of string s is not greater than 106 characters.

The second line contains an integer n (1 ≤ n ≤ 105) — the number of queries. Then n lines follow: the i-th line contains the string xi — the string for the i-th query. The total length of xi is less than or equal to 106 characters.

In this problem, strings only consist of lowercase English letters.

Output

For each query xi print a single integer that shows how many consecutive substrings of s are cyclical isomorphic to xi. Print the answers to the queries in the order they are given in the input.

Examples

Input

baabaabaaa
5
a
ba
baa
aabaa
aaba


Output

7
5
7
3
5


Input

aabbaa
3
aa
aabb
abba


Output

2
3
3

Solution (in JAVA):

Solution:
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.LinkedList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author sheep
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		CyclicalQuest solver = new CyclicalQuest();
		solver.solve(1, in, out);
		out.close();
	}
}

class SuffixAutomaton {

    public final int ALPHA;
    public int totalNodes;

    class SuffixAutomatonNode{
        SuffixAutomatonNode suffixNode, next;
        SuffixAutomatonNode ch[];

        int tag;
        int maximumLength;
        int positions;
        SuffixAutomatonNode() {
            suffixNode = null;
            ch = new SuffixAutomatonNode[ALPHA];
            maximumLength = 0;
            positions = 0;
            tag = 0;
            next = null;

            list.add(this);
        }
        SuffixAutomatonNode(SuffixAutomatonNode ch[]) {
            suffixNode = null;
            this.ch = ch;
            maximumLength = 0;
            positions = 0;
            tag = 0;
            next = null;

            list.add(this);
        }

    }

    SuffixAutomatonNode root;
    SuffixAutomatonNode lastNode;

    LinkedList<SuffixAutomatonNode> list;

    SuffixAutomaton(int ALPHA) {
        this.ALPHA = ALPHA;
        totalNodes = 0;
        list = new LinkedList<SuffixAutomatonNode>();
        root = new SuffixAutomatonNode();
        lastNode = root;
    }

    public void append(char[] s) {
        for (int i = 0; i < s.length; ++i) {
            this.extend(s[i] - 'a');
        }
    }

    SuffixAutomatonNode extend(int c, SuffixAutomatonNode rear) {
        SuffixAutomatonNode p = rear;
        SuffixAutomatonNode np = new SuffixAutomatonNode();
        np.maximumLength = p.maximumLength + 1;
        np.positions = 1;
        while (null != p && null == p.ch[c]) {
            p.ch[c] = np;
            p = p.suffixNode;
        }

        if (p == null) {
            np.suffixNode = root;
        } else {
            SuffixAutomatonNode q = p.ch[c];
            if (q.maximumLength == p.maximumLength + 1) {
                np.suffixNode = q;
            } else {
                SuffixAutomatonNode nq = new SuffixAutomatonNode(q.ch.clone());
                nq.maximumLength = p.maximumLength + 1;
                nq.suffixNode = q.suffixNode;
                q.suffixNode = nq;
                np.suffixNode = nq;

                while (null != p && p.ch[c] == q) {
                    p.ch[c] = nq;
                    p = p.suffixNode;
                }
            }
        }

        lastNode = np;
        return np;
    }

    SuffixAutomatonNode extend(int c) {
        return extend(c, lastNode);
    }


    void calcPositions() {
        SuffixAutomatonNode first[] = new SuffixAutomatonNode[list.size() + 1];
        for (SuffixAutomatonNode node : list) {
            node.next = first[node.maximumLength];
            first[node.maximumLength] = node;
        }

        for (int i = list.size(); i >= 0; --i) {
            for (SuffixAutomatonNode node = first[i]; node != null; node = node.next) {
                if (node.suffixNode != null) {
                    node.suffixNode.positions += node.positions;
                }
            }
        }
        /*
        Queue<SuffixAutomatonNode> q = new LinkedList<SuffixAutomatonNode>();

        for (SuffixAutomatonNode node : list) {
            if (node.suffixNode != null) {
                ++node.suffixNode.deg;
            }
        }

        for (SuffixAutomatonNode node : list) {
            if (node.deg == 0) {
                q.add(node);
            }
        }

        while (!q.isEmpty()) {
            SuffixAutomatonNode node = q.poll();
            if (node.suffixNode != null) {
                --node.suffixNode.deg;
                node.suffixNode.positions += node.positions;
                if (0 == node.suffixNode.deg) {
                    q.offer(node.suffixNode);
                }
            }
        }
        */
    }
}

class CyclicalQuest {

    int JIECAO(char[] s) {
        int n = s.length;
        int[] nxt = new int[n + 1];
        nxt[0] = -1;
        for (int i = 1; i <= n; i++) {
            int j = nxt[i - 1];
            while (j >= 0 && s[j] != s[i - 1])
                j = nxt[j];
            nxt[i] = j + 1;
        }
        int a = n - nxt[n];
        if (n % a == 0)
            return a;
        return n;
    }

	public void solve(int testNumber, InputReader in, PrintWriter out) {
        String s = in.next();
        SuffixAutomaton sa = new SuffixAutomaton(26);
        sa.append(s.toCharArray());
        sa.calcPositions();
        int n = in.nextInt();
        for (; n != 0; --n) {
            char str[] = in.next().toCharArray();
            int length = str.length;
            if (length > s.length()) {
                out.println(0);
                continue;
            }
            int ans = 0;
            SuffixAutomaton.SuffixAutomatonNode node = sa.root;
            int match = 0;
            int maxLength = JIECAO(str) + str.length;
            for (int i = 0; i < maxLength; ++i) {
                int c = str[(i >= length ? i - length : i)] - 'a';
                if (match + 2 * length - i + 10 < length) {
                    break;
                }
                while (node != null && node.ch[c] == null) {
                    node = node.suffixNode;
                    if (node != null) {
                        match = node.maximumLength;
                    }
                }
                if (node == null) {
                    node = sa.root;
                } else {
                    ++match;
                    node = node.ch[c];
                    if (match >= length) {
                        if (n + 1 != node.tag) {
                            node.tag = n + 1;
                            ans += node.positions;
                        }

                        if (node.suffixNode.maximumLength >= length - 1) {
                            node = node.suffixNode;
                            match = node.maximumLength;
                        } else {
                            --match;
                        }
                    }
                }
            }

            out.println(ans);
        }
	}
}

class InputReader {
    BufferedReader reader;
    StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    }
//