package algorithm;

import java.util.HashMap;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt(), m = scan.nextInt();
		int[][] a = new int[105][105];
		String s;
//		System.out.println(n+" "+m);
		for(int i = 1; i <= n; i++) {
			s = scan.next();
			for(int j = 1; j <= m; j++) {
				if(s.charAt(j-1) == '*') {
					a[i][j] = 1;
				}
			}
		}
//		for(int i = 1; i <= n; i++) {
//			for(int j = 1; j <= m; j++) {
//				System.out.println(a[i][j]);
//			}
//			System.out.println();
//		}
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				if(a[i][j] == 1) {
					System.out.print('*');
				}else {
					System.out.print(a[i+1][j+1]+a[i+1][j-1]+a[i+1][j]+a[i][j+1]+a[i][j-1]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]);
				}
			}
			System.out.println();
		}
	}
	
}