PROGRAMMING:Diff
In computing, `diff` is a file comparison utility that outputs the differences between two files. It is typically used to show the changes between a file and a former version of the same file. `Diff` displays the changes made per line for text files.
The operation of `diff` is based on solving the `longest common subsequence problem` which is as follows: Given two sequences $$A = a_ 1, a_ 2,\cdots , a_ M$$, and $$B = b_ 1 , b_ 2 , \cdots , b_ N$$, find the length, $$k$$, of the longest sequence $$C = c_ 1 , c_ 2 , \cdots , c_ k$$ such that $$C$$ is a subsequence of both $$A$$ and $$B$$. As an example, if
```
A = d, y, n, a, m, i, c
```
and
```
B = p, r, o, g, r, a, m, m, i, n, g
```
then the longest common subsequence is `a`, `m`, `i` and has length 3.
From the longest common subsequence it's only a small step to get diff-like output:
```
dyn-progr+m+c-ng+
```
where `-` means a deletion from and `+` means an addition to the first string.
Now you are supposed to simulate the diff operation.
### Input Specification:
Each input file contains one test case. Each case contains the contents of two files. The case starts with two non-negative integers $$N$$ and $$M$$ (both $$\le 50$$), then followed by $$N+M$$ lines, each contains a string of no more than 80 characters. The first $$N$$ lines are the contents of the first file, while the second $$M$$ lines are of the second file.
### Output Specification:
For each test case, if there is no difference found between the two files, print in a line "No difference found". If there is nothing in common between the two files, print in a line "Totally different". Otherwise, first print in a line the length of the longest sequence. Then for each line of the first file, print the line number, and output the differences in the diff-like format line by line, as shown by the sample output.
### Sample Input 1:
```in
1 1
This is a test
This is a test
```
### Sample Output 1:
```out
No difference found
```
### Sample Input 2:
```
1 1
ab
cd
```
### Sample Output 2:
```
Totally different
```
### Sample Input 3:
```
5 5
This line is the same
This is a test
which is more complicated
zzz
than ...
This line is the same
This is another test
of the project
which is much more complex
than the previous one
```
### Sample Output 3:
```
sixty
line #1:
line #2:
nother+
line #3:
of the project+
much+icat-d-
line #4:
zzz-
line #5:
x+
...-the previous one+
```
answer：If there is no answer, please comment
The operation of `diff` is based on solving the `longest common subsequence problem` which is as follows: Given two sequences $$A = a_ 1, a_ 2,\cdots , a_ M$$, and $$B = b_ 1 , b_ 2 , \cdots , b_ N$$, find the length, $$k$$, of the longest sequence $$C = c_ 1 , c_ 2 , \cdots , c_ k$$ such that $$C$$ is a subsequence of both $$A$$ and $$B$$. As an example, if
```
A = d, y, n, a, m, i, c
```
and
```
B = p, r, o, g, r, a, m, m, i, n, g
```
then the longest common subsequence is `a`, `m`, `i` and has length 3.
From the longest common subsequence it's only a small step to get diff-like output:
```
dyn-progr+m+c-ng+
```
where `-` means a deletion from and `+` means an addition to the first string.
Now you are supposed to simulate the diff operation.
### Input Specification:
Each input file contains one test case. Each case contains the contents of two files. The case starts with two non-negative integers $$N$$ and $$M$$ (both $$\le 50$$), then followed by $$N+M$$ lines, each contains a string of no more than 80 characters. The first $$N$$ lines are the contents of the first file, while the second $$M$$ lines are of the second file.
### Output Specification:
For each test case, if there is no difference found between the two files, print in a line "No difference found". If there is nothing in common between the two files, print in a line "Totally different". Otherwise, first print in a line the length of the longest sequence. Then for each line of the first file, print the line number, and output the differences in the diff-like format line by line, as shown by the sample output.
### Sample Input 1:
```in
1 1
This is a test
This is a test
```
### Sample Output 1:
```out
No difference found
```
### Sample Input 2:
```
1 1
ab
cd
```
### Sample Output 2:
```
Totally different
```
### Sample Input 3:
```
5 5
This line is the same
This is a test
which is more complicated
zzz
than ...
This line is the same
This is another test
of the project
which is much more complex
than the previous one
```
### Sample Output 3:
```
sixty
line #1:
line #2:
nother+
line #3:
of the project+
much+icat-d-
line #4:
zzz-
line #5:
x+
...-the previous one+
```
answer：If there is no answer, please comment