#include <cstdio>#include <cstring>#include <iostream>#include <queue>#define maxn 507using namespace std;

struct node{int x,y;int num;    friend bool operator < (const node &a,const node &b)    {return a.num > b.num;    }};int h,w,mark,sx,sy;char str[maxn][maxn];bool vt[maxn][maxn];int f[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};priority_queue<node>q;

int bfs(int sx,int sy){    node p;    p.x = sx; p.y = sy;    p.num = 1;while (!q.empty()) q.pop();    q.push(p);    vt[p.x][p.y] = true;while (!q.empty())    {        node cur;        cur = q.top(); q.pop();if (cur.x == 0 || cur.x == h -1 || cur.y == 0 || cur.y == w -1)        {return cur.num;        }for (int i = 0; i < 4; ++i)        {            p.x = cur.x + f[i][0];            p.y = cur.y + f[i][1];if (p.x >= 0 && p.x < h && p.y >= 0 && p.y < w && !vt[p.x][p.y] && str[p.x][p.y] != '#')            {                vt[p.x][p.y] = true;                p.num = cur.num + 1;if (str[p.x][p.y] == '@') p.num += mark;                q.push(p);            }        }    }}int main(){int i,j,t;    scanf("%d",&t);while (t--)    {        memset(vt,false,sizeof(vt));        scanf("%d%d%d",&h,&w,&mark);for (i = 0; i < h; ++i)        {            scanf("%s",str[i]);for (j = 0; j < w; ++j)           {if (str[i][j] == 'S')               {                   sx = i; sy = j;               }           }        }int ans = bfs(sx,sy);        printf("%d\n",ans);    }return 0;}

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#define inf 0x7fffffffusing namespace std;

int main(){int N,i,a,b;double ansx,ansy,z,x;int t;    scanf("%d",&t);while (t--)    {bool flag = false;        ansx = inf;        ansy = inf;        scanf("%d",&N);for (i = 1; i <= sqrt(1.0*N); ++i)        {if (N%i == 0)            {                a = N/i;                b = i;                z = 1.0*(a + b)/2.0;int tmp = (int)z;//z保证是大于0整数                if (tmp != z) continue;                x = z - min(a,b);if (x >= 0)//x保证是大于0整数                {                    flag = true;if (ansx > x && ansy > z)                    {                       ansx = x; ansy = z;                    }                }            }        }if (flag)        printf("%.0lf %.0lf\n",ansx,ansy);else        printf("IMPOSSIBLE\n");    }return 0;}