MORSE - Decoding Morse Sequences


Before the digital age, the most common "binary" code for radio communication was the Morse code. In Morse code, symbols are encoded as sequences of short and long pulses (called dots and dashes respectively). The following table reproduces the Morse code for the alphabet, where dots and dashes are represented as ASCII characters "." and "-":

A .-   B -... C -.-. D -.. 
E .    F ..-. G --.  H .... 
I ..   J .--- K -.-  L .-.. 
M --   N -.   O ---  P .--. 
Q --.- R .-.  S ...  T - 
U ..-  V ...- W .--  X -..- 
Y -.-- Z --..

Notice that in the absence of pauses between letters there might be multiple interpretations of a Morse sequence. For example, the sequence -.-..-- could be decoded both as CAT or NXT (among others). A human Morse operator would use other context information (such as a language dictionary) to decide the appropriate decoding. But even provided with such dictionary one can obtain multiple phrases from a single Morse sequence.

Task

Write a program that:

  • reads a Morse sequence and a list of words (a dictionary),
  • computes the number of distinct phrases that can be obtained from the given Morse sequence using words from the dictionary,
  • writes the result.

Notice that we are interested in full matches, i.e. the complete Morse sequence must be matched to words in the dictionary.

Input

The first line of the input contains exactly one positive integer d equal to the number of data sets, 1 <= d <= 20. The data sets follow.

The first line of each data set contains a Morse sequence - a nonempty sequence of at most 10000 characters "." and "-" with no spaces in between.

The second line contains exactly one integer n, 1 <= n <= 10000, equal to the number of words in a dictionary. Each of the following n lines contains one dictionary word - a nonempty sequence of at most 20 capital letters from "A" to "Z". No word occurs in the dictionary more than once.

Output

The output should consist of exactly d lines, one line for each data set. Line i should contain one integer equal to the number of distinct phrases into which the Morse sequence from the i-th data set can be parsed. You may assume that this number is at most 2*109 for every single data set.

Example

Sample input:
1 
.---.--.-.-.-.---...-.---. 
6 
AT 
TACK 
TICK 
ATTACK 
DAWN 
DUSK 

Sample output:
2 

hide comments
devbishnoi: 2017-02-25 08:50:00

took whole day to just figure out that same word can appear more than ones and these same words will be considered different while calculating number of ways.
for example
1
.
2
E
E
No of ways will be 2.

kolahzary: 2016-02-07 16:27:53

it seems something is wrong :|
the sequence(.---.--.-.-.-.---...-.---.) can contain 4 words =>

AT: .--
TACK: -.--.-.-.-
ATTACK: .---.--.-.-.-
DAWN: -...-.---.
-------------------------------------------------------------------
and if no character of sequence should be used more than once, then the sequence is composed of this three words:

ATTACK: .---.--.-.-.-
AT: .--
DAWN: -...-.---.
------------------------------------------------------------
it means the output should be 4 or 3, but as you can see in the example, it's 2 !
someone please explain this example for me :((

Jose Sanchez: 2014-11-06 18:52:43

Warning: the words can appear more than once!
@azalathemad: you are right :)

harsh: 2014-04-16 19:09:29

nice question.

Last edit: 2014-04-17 15:04:07
Dewan Mahmud Raihan: 2013-12-23 10:57:59

really nice problem.

Badr: 2013-03-02 15:58:23

@azalathemad

The word it self does not occur more than once but its interpretation in dashes and dots is the one which may occur more than once as some alphabets are prefix for another.

azalathemad: 2012-09-19 08:05:08

I believe the line "No word occurs in the dictionary more than once." is incorrect.

I used a capital-letter-based trie (not morse-based), marking nodes 1 or 0 based on whether or not the word was found. This resulted in WA every time, until AC when marking nodes based on the number of times the word was found. That would imply the existence of a duplicate word.


Added by:adrian
Date:2004-07-02
Time limit:7s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:ACM Central European Programming Contest, Warsaw 2001