Smart Beaver recently got interested in a new word game. The point is as follows: count the number of distinct good substrings of some string s. To determine if a string is good or not the game uses rules. Overall there are n rules. Each rule is described by a group of three (p, l, r), where p is a string and l and r (l ≤ r) are integers. We’ll say that string t complies with rule (p, l, r), if the number of occurrences of string t in string p lies between l and r, inclusive. For example, string "ab", complies with rules ("ab", 1, 2) and ("aab", 0, 1), but does not comply with rules ("cd", 1, 2) and ("abab", 0, 1).

A substring s[l... r] (1 ≤ l ≤ r ≤ |s|) of string s = s1s2... s|s| (|s| is a length of s) is string slsl + 1... sr.

Consider a number of occurrences  of string t in string p as a number of pairs of integers l, r (1 ≤ l ≤ r ≤ |p|) such that p[l... r] = t.

We’ll say that string t is good if it complies with all n rules. Smart Beaver asks you to help him to write a program that can calculate the number of distinct good substrings of string s. Two substrings s[x... y] and s[z... w] are cosidered to be distinct iff s[x... y] ≠ s[z... w].

Input

The first line contains string s. The second line contains integer n. Next n lines contain the rules, one per line. Each of these lines contains a string and two integers pi, li, ri, separated by single spaces (0 ≤ li ≤ ri ≤ |pi|). It is guaranteed that all the given strings are non-empty and only contain lowercase English letters.

The input limits for scoring 30 points are (subproblem G1): 

  * 0 ≤ n ≤ 10. 
  * The length of string s and the maximum length of string p is  ≤ 200. 



The input limits for scoring 70 points are (subproblems G1+G2): 

  * 0 ≤ n ≤ 10. 
  * The length of string s and the maximum length of string p is  ≤ 2000. 



The input limits for scoring 100 points are (subproblems G1+G2+G3): 

  * 0 ≤ n ≤ 10. 
  * The length of string s and the maximum length of string p is  ≤ 50000. 

Output

Print a single integer — the number of good substrings of string s.

Examples

Input

aaab
2
aa 0 0
aab 1 1


Output

3


Input

ltntlnen
3
n 0 0
ttlneenl 1 4
lelllt 1 1


Output

2


Input

a
0


Output

1

Note

There are three good substrings in the first sample test: «aab», «ab» and «b».

In the second test only substrings «e» and «t» are good.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;


public class G2 {	
	BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter out;
    
    int a1 = 3621;
    int a2 = 4631;
    int p1 = 1328463329;
    int p2 = 1274368201;
    
	public void solve() throws IOException {				
		char[] s = reader.readLine().toCharArray();
		long[] hashes = getUnique(getHashes(s));
		
		boolean[] failed = new boolean[hashes.length];
		int N = nextInt();
		for(int i = 0; i < N; i++){
			String[] str = reader.readLine().split(" ");
			char[] p = str[0].toCharArray();
			int l = Integer.parseInt(str[1]);
			int r = Integer.parseInt(str[2]);
			
			long[] hashesP = getHashes(p);
			
			int ptr = 0;
			for(int j = 0; j < hashes.length; j++){
				int cnt = 0;
				while( ptr < hashesP.length && hashesP[ptr] < hashes[j] )
					ptr++;
				while( ptr < hashesP.length && hashesP[ptr] == hashes[j] ){
					ptr++;
					cnt++;
				}
				if( cnt < l || cnt > r)
					failed[j] = true;				
			}
		}
		int ans = 0;
		for(int i = 0; i < failed.length; i++)
			if( !failed[i] ) ans++;
		out.println( ans );
	}
	
	public long[] getUnique(long[] input){
		long[] output = new long[input.length];
		int cnt = 0;
		int ptr1 = 0;
		while( ptr1 < input.length ){
			output[cnt++] = input[ptr1];			
			int ptr2 = ptr1;
			while( ptr2 < input.length && input[ptr2] == input[ptr1] ) 
				ptr2++;			
			ptr1 = ptr2;			
		}
		output = Arrays.copyOfRange(output, 0, cnt);
		return output;
	}
	
	public long[] getHashes(char[] s){
		long[] hashes = new long[ s.length * (s.length+1) / 2 ];
		int c = 0;
		for(int i = 0; i < s.length; i++){
			long h1 = 0;
			long h2 = 0;
			for(int j = i; j < s.length; j++){
				h1 = (h1 * a1 + s[j]) % p1;
				h2 = (h2 * a2 + s[j]) % p2;
				hashes[c++] = (h1 << 32) + h2;
			}
		}
		Arrays.sort( hashes );
		return hashes;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new G2().run();
	}
	
	public void run() {
        try {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
            out = new PrintWriter(System.out);
            solve();
            reader.close();
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

}
