URRRRGENT!!!!

time limit per test: 1 second 0 memory limit per test: 256 megabytes input: standard input output: standard output Given a grid of lowercase english letters, denoted a, of n rows and m columns, and a string of characters s, determine if you can construct s from the grid a. Words can be constructed from grid a through the following process: - Initially, you pick any cell (i,j) then you write down the letter a[i][j] on an empty whiteboard. - For each of the following moves, you can choose any adjacent cell and then write down the letter a[i][j] on the whiteboard. - You can end this process at any point. Two cells are considered adjacent if they share a side or an edge. Input The first line of input contains two space seperated integers n(1n7) and m (1m7). The following n lines contain strings of m characters representing grid a. The last line of the input contains s - the string that you want to construct. Output If it is possible to construct the s through the process described in the statement, print "Yes" (Case insensitive). Otherwise, print "NO". time limit per test: 1 second 0 memory limit per test: 256 megabytes input: standard input output: standard output You are given a grid, denoted a, of n rows and m columns. Initially, you start at cell (1, 1). At any instance, you can either move to cell (i+1,j) or cell (i,j+1), but you cannot move into a cell with an obstacle or stay in the same cell. Count the number of ways to reach cell (n,m). It is said that cell (i,j) contains an obstacle if a[i][j]=1. Input The first line of input contains two space seperated integers n and m(1n+m12). The following n lines contain m space seperated integers where the ith row and jth column is the value of a[i][j]. It is guaranteed that cells (1,1) and (n,m) do not have obstacles. Output A single integer - the number of ways to reach cell (n,m)