Word Maze Navigator

You are given a 2D grid of characters and a dictionary of words. Implement a function to find all words from the dictionary that can be formed by navigating adjacent cells (horizontally or vertically) in the grid. Each cell can be used only once for each word. Words must be returned in lexicographical order. Input consists of the grid size followed by grid characters and then dictionary words. Output should be a newline-separated list of found words. Example: Input: 2 2 ab cd ab ac dc Output: ab