#include <fstream>
#include <cmath>

using namespace std;

int prim(int x) {
    int p, ok = 1;
    if (x < 2)
        return 0;
    for (p = 2; p <= sqrt(x); p++)
        if (x % p == 0) {
            ok = 0;
            break;
        }

    return ok;
}

int main() {
    ifstream f("robab.in");
    ofstream g("robab.out");
    int n, m, v[401], a[401][401], A = 0, b = 0, s, sa = 0, sb = 0, i, j, x, nrprime;

    f >> n >> m;
    for (i = 1; i <= n; i++) {
        nrprime = 0;
        for (j = 1; j <= m; j++) {
            f >> a[i][j];
            if (prim(a[i][j]) == 1) {
                nrprime++;
                v[j] = 1;
            }
            else
                v[j] = 0;
        }

        if (nrprime % 2 != 0) {
            A++;
            for (j = 1; j <= m; j++) {
                if (v[j] == 0)
                    sa += a[i][j];

                if (v[j] == 1)
                    break;
            }
        }
        else if (nrprime != 0) {
            b++;
            for (j = m; j >= 1; j--) {
                if (v[j] == 0)
                    sb += a[i][j];
                if (v[j] == 1)
                    break;
            }
        }
    }

    g << A << " " << sa << endl << b << " " << sb;
    return 0;
}