PROGRAMMING:All longest common subsequences of two strings

Find all the longest common subsequences of two strings.
###Input format:
Enter two strings of length ≤ 100.
###Output format:
Output all the longest common subsequences of two strings. If there is more than one longest common subsequence, all subsequences will be sorted from small to large in dictionary order and output.
###Input sample 1:
```in
ABCBDAB
BDCABA
```
###Output sample 1:
```out
BCAB
BCBA
BDAB
```
###Input sample 2:
```in
ABACDEF
PGHIK
```
###Output sample 2:
```out
NO
```






answer：If there is no answer, please comment