import java.util.*;
import java.util.stream.*;
import java.io.*;
import java.math.*;

public class Main {

	void solve (FastScanner in, PrintWriter out, Methods ms) {

		int n = in.nextInt();
		
		for (int i=0; i<n; i++) {
			
			int[][] map = new int[8][8];
			for (int j=0; j<8; j++) {
				String s = in.next();
				for (int k=0; k<8; k++) {
					map[j][k] = s.charAt(k) - '0';
				}
			}
			
			int x = in.nextInt()-1, y = in.nextInt()-1;
			Point start = new Point(y, x);
			
			ArrayDeque<Point> dq = new ArrayDeque<>();
			dq.addLast(start);
			
			while (dq.size() > 0) {
				
				Point p = dq.removeFirst();
				map[p.y][p.x] = 0;
				
				ArrayList<Point> temp = p.getAround(8, 8);
				for (int j=0; j<temp.size(); j++) {
					if (map[temp.get(j).y][temp.get(j).x] == 1) {
						dq.addLast(new Point(temp.get(j).y, temp.get(j).x));
					}
				}
			}
			
			out.println("Data " + (i+1) + ":");
			printIntMap(out, map);
			
			
		}
		

	}
	
	
	
	static void printIntMap (PrintWriter out, int[][] map) {
		for (int i=0; i<map.length; i++) {
			for (int j=0; j<map[0].length; j++) {
				out.print(map[i][j]);
			}
			out.println();
		}
	}

	static class Point{
		int y, x;
		
		Point (int a, int b) {y=a; x=b;}
		
		int getY() {return y;}
		int getX() {return x;}
		
		ArrayList<Point> getAround (int limitY, int limitX) {
			ArrayList<Point> list = new ArrayList<>();
			list.add(new Point(y+1, x));
			list.add(new Point(y+2, x));
			list.add(new Point(y+3, x));
			list.add(new Point(y-1, x));
			list.add(new Point(y-2, x));
			list.add(new Point(y-3, x));
			list.add(new Point(y, x+1));
			list.add(new Point(y, x+2));
			list.add(new Point(y, x+3));
			list.add(new Point(y, x-1));
			list.add(new Point(y, x-2));
			list.add(new Point(y, x-3));
			for (int i=list.size()-1; i>=0; i--) {
				int y = list.get(i).y, x = list.get(i).x;
				if (x<0 || y<0 || x>=limitX || y>=limitY) {
					list.remove(i);
				}
			}
			return list;
		}
	}


	public static void main(String[] args) {
		Main main = new Main();
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Methods ms = new Methods();
		main.solve(in, out, ms);
		in.close();
		out.close();
	}

	static class Methods {

		public void print (Object... ar) {System.out.println(Arrays.deepToString(ar));}

		public void yesno (PrintWriter out, boolean b) {out.println(b?"Yes":"No");}

		public void YESNO (PrintWriter out, boolean b) {out.println(b?"YES":"NO");}

		public int max (int... ar) {Arrays.sort(ar); return ar[ar.length-1];}

		public int min (int... ar) {Arrays.sort(ar); return ar[0];}

		public long gcd (long a, long b) {return b>0?gcd(b,a%b):a;}

		public long lcm (long a, long b) {return a/gcd(a,b)*b;}

		public long factorial (int i) {
			if (i==1) return 1;
			else return i*factorial(i-1);
		}

		public int manhat (int x1, int y1, int x2, int y2) {
			return Math.abs(x1-x2)+Math.abs(y1-y2);
		}
		
		public double euclid (double x1, double y1, double x2, double y2) {
			return Math.sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
		}

		public boolean isPrime (int n) {
			if (n==2) return true;
			if (n<2 || n%2==0) return false;
			for (int i=3; i<=Math.sqrt(n); i+=2) if(n%i==0) return false;
			return true;
		}

	}

	static class FastScanner {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private  int length = 0, p = 0;

		public FastScanner (InputStream stream) {
			in = stream;
		}

		public boolean hasNextByte () {
			if (p < length) return true;
			else {
				p = 0;
				try {length = in.read(buffer);}
				catch (Exception e) {e.printStackTrace();}
				if (length <= 0) return false;
			}
			return true;
		}

		public int readByte () {
			if (hasNextByte() == true) return buffer[p++];
			return -1;
		}

		public boolean isPrintable (int n) {return 33<=n&&n<=126;}

		public void skip () {
			while (hasNextByte() && !isPrintable(buffer[p])) p++;
		}

		public boolean hasNext () {skip(); return hasNextByte();}

		public String next () {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int t = readByte();
			while (isPrintable(t)) {
				sb.appendCodePoint(t);
				t = readByte();
			}
			return sb.toString();
		}

		public String[] nextArray (int n) {
			String[] ar = new String[n];
			for (int i=0; i<n; i++) ar[i] = next();
			return ar;
		}

		public int nextInt () {return Math.toIntExact(nextLong());}

		public int[] nextIntArray (int n) {
			int[] ar = new int[n];
			for (int i=0; i<n; i++) ar[i] = nextInt();
			return ar;
		}

		public long nextLong () {
			if (!hasNext()) throw new NoSuchElementException();
			boolean minus = false;
			int temp = readByte();
			if (temp == '-') {
				minus = true;
				temp = readByte();
			}
			if (temp<'0' || '9'<temp) throw new NumberFormatException();
			long n = 0;
			while (isPrintable(temp)) {
				if ('0'<=temp && temp<='9') {
					n *= 10;
					n += temp - '0';
				}
				else throw new NumberFormatException();
				temp = readByte();
			}
			return minus? -n : n;
		}

		public long[] nextLongArray (int n) {
			long[] ar = new long[n];
			for (int i=0; i<n; i++) ar[i] = nextLong();
			return ar;
		}

		public double nextDouble () {
			return Double.parseDouble(next());
		}

		public double[] nextDoubleArray (int n) {
			double[] ar = new double[n];
			for (int i=0; i<n; i++) ar[i] = nextDouble();
			return ar;
		}

		public void close () {
			try {in.close();}
			catch(Exception e){}
		}

	}

}


Measured memory_bytes: 28100