#include <bits/stdc++.h>
using namespace std;

int a[110][110];
int n,m,c = 0;

bool sushu(int n){
	if(n <= 1) return false;
	for(int i = 2;i <= sqrt(n);i++){
		if(n % i == 0) return false;
	}
	return true;
}

int main() {
	cin>>n>>m;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			cin>>a[i][j];
		}
	}
	
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			if(sushu(a[i][j])&&!sushu(a[i-1][j-1])&&!sushu(a[i-1][j])&&!sushu(a[i-1][j+1])&&!sushu(a[i][j+1])&&!sushu(a[i+1][j+1])&&!sushu(a[i+1][j])&&!sushu(a[i+1][j-1])&&!sushu(a[i][j-1])){
			   	c++;
			   }
		}
	}
	
	cout<<c;
	return 0;
}