#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <bitset>
using namespace std;
#define dist(a,b) _dist((a)^(b))
char line[100];
int readnum() {
	scanf("%s", line);
	int len = strlen(line);
	int rez = 0;
	for (int i=0; i<len; i++) {
		rez<<=1;
		if (line[i] == '1')
			rez |= 1;
	}
	return rez;
}
int _dist(int c) {
	int d = 0;
	while (c > 0) {
		if (c & 1)
			d++;
		c >>= 1;
	}
	return d;
}
int main(int argc, char **argv) {
	freopen("formula.in", "r", stdin);
	freopen("formula.out", "w", stdout);
	int m, n;
	scanf("%d %d", &m, &n);
	int vita = readnum();
	const int max = 1<<n;
	int* cost = new int[max];
	memset(cost, -1, max * sizeof(int));
	for (int i = 0; i < m; ++i) {
		int f = readnum();
		cost[f] = 1;
		for (int j=0; j<max; j++) {
			if (cost[j] < 0)
				continue;
			int uk = f ^ j;
			int cs = cost[j] + 1;
			if (cost[uk] < 0 || cs < cost[uk]) {
				cost[uk] = cs;
			}
		}
	}
	int mincost = 100000;
	int mindist = 100;
	for (int i=0; i<max; i++) {
		if (cost[i] < 1)
			continue;
		int d= dist(vita, i);
		if (d < mindist) {
			mindist = d;
			mincost = cost[i];
		} else if (d == mindist && cost[i] < mincost) {
			mincost = cost[i];
		}
	}
	printf("%d %d\n", mincost, n-mindist);
	return 0;
}