#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

const int P = 27;
const int N = 12;
LL pw[P];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	pw[0] = 1;
	FOR(i, 1, N)
		pw[i] = pw[i - 1] * P;
	map<LL, int> cnt;
	pair<int, string> ans = {1e9, ""};
	
	int n, c;
	cin >> n >> c;
	vector<string> v(n);
	FOR (i, 0, n)
		cin >> v[i];
	FOR (i, 0, n)
	{
		LL hs = 0;
		FOR (j, 0, c)
		{
			if (v[i][j] != '*')
				hs += (v[i][j] - 'a' + 1) * pw[j];
		}
		cnt[hs]++;
	}
	FOR (i, 0, n)
	{
		int pos = -1;
		LL hs = 0;
		FOR (j, 0, c)
		{
			if (v[i][j] == '*')
				pos = j;
			else
				hs += (v[i][j] - 'a' + 1) * pw[j];
		}
		FOR (ch, 'a', 'z' + 1)
		{
			hs += (ch - 'a' + 1) * pw[pos];
			v[i][pos] = ch;
			int cur = 0;
			FOR(j, 0, c)
			{
				hs -= (v[i][j] - 'a' + 1) * pw[j];
				if (cnt.count(hs))
					cur += cnt[hs];
				hs += (v[i][j] - 'a' + 1) * pw[j];
			}
			hs -= (ch - 'a' + 1) * pw[pos];
			ans = min(ans, MP(-cur, v[i]));
		}
	}
	cout << ans.S << ' ' << -ans.F << '\n';
	
	
	return 0;
}