BETA

Difficulty Level:

Hard

Total Submissions: 853 Accuracy:

12.54%

Print all LCS sequences
       

You are given two strings a and b. Now your task is to print all longest common sub-sequences in lexicographical order.

Input:
The first line of input contains an integer denoting the no of test cases T. Then T test case follow each test case contains 2 space separated strings a and b.

Output:
For each test case in a new line  print the space separated sequences.

Constraints:
1<=T<=100
1<=length of strings a and b<=100

Example:
Input:

2
abaaa baabaca
aaa a
Output:
aaaa abaa baaa
a

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.