A coastal telegraph station took storm damage overnight, and a handful of letter keys on its transmitter panel have jammed solid: pressing any of them does nothing. The operator's logbook holds one dispatch, a line of lowercase words separated by single spaces. A word can still be sent in full only if none of its letters need a jammed key; a single jammed letter anywhere in a word means the whole word must be dropped. Count how many words in the dispatch can still be transmitted in full.

Input format

• Line 1: the dispatch, a string of lowercase English letters and single spaces, with no leading or trailing spaces and no two consecutive spaces.
• Line 2: the jammed keys, a (possibly empty) string of distinct lowercase English letters. If no keys are jammed, this line is empty.

Output format

Print a single integer: the number of words in the dispatch that contain no jammed letter.

Constraints

• 1 <= length of the dispatch <= 1000
• The dispatch consists only of lowercase English letters and single spaces separating words.
• 0 <= number of jammed keys <= 26, all distinct lowercase letters.

hello world
ad

1

leet code
lt

1