#include <stdio.h>
int isPrim(int number) {
	if (number < 2) return 0;
    int i;
    for (i=2; i*i<=number; i++)
        if (number % i == 0) return 0;
    return 1;
}
void main() {
	int n,m,i,j,p = 0;
	int a[10][10],primek[100];
	printf("n = ");scanf("%d", &n);
	printf("m = ");scanf("%d", &m);
	for (i=0;i<n;i++)
		for (j=0;j<m;j++) {
			printf("a[%d][%d]: ", i,j);
			scanf("%d", &a[i][j]);
			if (isPrim(a[i][j]) == 1) {
				primek[p] = a[i][j];
				p++;
			}
		}
	printf("\nA matrix:\n");
	for (i=0;i<n;i++) {
		for (j=0;j<m;j++)
			printf("%d ", a[i][j]);
		printf("\n");
	}
	printf("\n%d primszam van: ", p);
	for (i=0;i<p;i++)
		printf("%d ", primek[i]);
	getch();
}