
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};


//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main(int argc, char const *argv[])
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;
	REP(a, n){
		VS table(8);
		REP(i, 8){
			cin >> table[i];
		}
		int x, y;
		cin >> x >> y;
		queue<PII> q;
		x--;
		y--;
		q.push(MP(y, x));
		while(!q.empty()){
			PII p = q.front();
			q.pop();
			int x = p.second, y = p.first;
			table[y][x] = 0;
			REP(i, 4){
				for(int m = 1; 3 >= m; m++){
					int dx = x + DX[i] * m;
					int dy = y + DY[i] * m;
					if(0 <= dx && dx <= 8 &&
					0 <= dy && dy <= 8 &&
					table[dy][dx] == 1){
						table[dy][dx] = 0;
						q.push(MP(dy, dx));
					}
				}
			}
		}
		cout << "Data " << a + 1 << ":" << endl;
		REP(i, 8){
			REP(j, 8){
				printf("%c", table[i][j]);
			}
			putchar('\n');
		}
	}
	
	return 0;
}