#include #include #include #include using namespace std; int N, M, K; int m[101][101]; int dp[101][101]; bool visit[101][101]; int bx[4] = {1, 0, -1, 0}; int by[4] = {0, 1, 0, -1}; vector trace; pair p[101][101]; void bfs() { queue q; q.push({0, 0}); while (!q.empty()) { int ny = q.front().first; int nx = q.front().second; q.pop(); for (int i = 0; i N >> M; for (int i = 0; i > s; for (int j = 0;..