FJ has had a terrible fight with his neighbor and wants to send him a nasty letter, but wants to remain anonymous. As so many before him have done, he plans to cut out printed letters and paste them onto a sheet of paper. He has an infinite number of the most recent issue of the Moo York Times that has ~N (1 \leq N \leq 50,000)~ uppercase letters laid out in a long string (though read in as a series of shorter strings). Likewise, he has a message he'd like to compose that is a single long string of letters but that is read in as a set of shorter strings.

Being lazy, he wants to make the smallest possible number of cuts. FJ has a really great set of scissors that enables him to remove any single-line snippet from the Moo York Times with one cut. He notices that he can cut entire words or phrases with a single cut, thus reducing his total number of cuts.

What is the minimum amount of cuts he has to make to construct his letter of M ~(1 \leq M \leq 50,000)~ letters?

It is guaranteed that it is possible for FJ to complete his task.

Consider a 38 letter Moo York Times:

THEQUICKBROWNFOXDO
GJUMPSOVERTHELAZYDOG

from which FJ wants to construct a 9 letter message:

FOXDOG
DOG

These input lines represent a pair of strings:

THEQUICKBROWNFOXDOGJUMPSOVERTHELAZYDOG
FOXDOGDOG

Since "FOXDOG" exists in the newspaper, FJ can cut this piece out and then get the last "DOG" by cutting out either instance of the word "DOG".

Thus, he requires but two cuts.

INPUT FORMAT:

• Line 1: Two space-separated integers: N and M

• Lines 2..?: N letters laid out on several input lines; this is the text of the one copy of the Moo York Times. Each line will have no more than 80 characters.

• Lines ?..?: M letters that are the text of FJ's letter. Each line will have no more than 80 characters.

SAMPLE INPUT

38 9
THEQUICKBROWNFOXDO
GJUMPSOVERTHELAZYDOG
FOXDOG
DOG

OUTPUT FORMAT:

• Line 1: The minimum number of cuts FJ has to make to create his message

SAMPLE OUTPUT

2