#include using namespace std; #define ll long long int #define MOD 1000000007 ll n,vis[500][500],dist[500][500]; pairpar[500][500]; ll dx[6]={-2,-2,0,2,2,0}; ll dy[6]={-1,1,2,1,-1,-2}; string sk[6]={"UL", "UR", "R", "LR", "LL", "L"}; bool inrange(ll nxx,ll nyy) { if(nxx>=0&&nxx=0&&nyy > q; ll i,j,k,nx,ny,nx1,ny1; q.push({sx,sy}); for(i=0;i<300;i++) { for(j=0;j<300;j++) { vis[i][j]=0; dist[i][j]=1000000; } } dist[sx][sy]=0; while(!q.empty()) { nx=q.front().first; ny=q.front().second; q.pop(); if(vis[nx][ny]) continue; vis[nx][ny]=1; for(i=0;i<6;i++) { nx1=nx+dx[i]; ny1=ny+dy[i]; // cout<(1+dist[nx][ny]))) { // cout<>n; cin>>sx>>sy>>dx>>dy; bfs(sx,sy); if(dist[dx][dy]>=100000) cout<<"Impossible\n"; else { stackst; cout<