Given a 2D grid (G[]) of characters and a word(x), find all occurrences of given word in grid. A word can be matched in all 8 directions at any point. Word is said be found in a direction if all characters match in this direction (not in zig-zag form).

The 8 directions are, Horizontally Left, Horizontally Right, Vertically Up, Vertically down and 4 Diagonal directions.

Example:

```
Input: G[][] = {"GEEKSFORGEEKS",
"GEEKSQUIZGEEK",
"IDEQAPRACTICE"};
x = "GEEKS"
Output: pattern found at 0, 0
pattern found at 0, 8
pattern found at 1, 0
```

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two space separated integers N and M denoting the size of the grid. Then in the next line are N * M space separated values of the grid. In the next line is the word x.

**Output:**

For each test case in a new line print the space separated sorted indexes of the matrix where after each index there is a ', ' . If there are no such occurences print -1.

**Constraints:**

1<=T<100

1<=N,M<=100

1<=G[]<=100

**Example:
Input:**

2

3 3

a b c d e f g h i

abc

4 3

a b a b a b e b e b e b

abe

0 0,

0 0, 0 2, 1 1,

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

KarlBreitkopf | 391 |

taruncrrm | 150 |

kaushalsahu3236 | 144 |

vikeshkumar1 | 112 |

RABB_RAAKHA | 108 |

bhupinderkumar | 690 |

Liza123 | 665 |

xbuttercupx | 657 |

vikeshkumar1 | 650 |

nishant.ns19 | 644 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4781 |

Quandray | 4444 |

Login to report an issue on this page.