#include <iostream>
#include <memory>
#include <map>
#include <queue>

struct node {
	std::map<char, std::unique_ptr<node>> children;
	const node *back;
	
	const node *step(char ch) const {
		const node *n = this;
		while (n->back != n && !n->children.contains(ch)) n = n->back;
		return n->children.contains(ch) ? n->children.at(ch).get() : n;
	}
};

size_t step(const node **query, size_t *table, size_t s, const node *n) {
	while (query[s] != n && s > 0) s = table[s];
	if (query[s] == n) ++s;
	return s;
}

int main() {
	size_t N, K;
	std::cin >> N >> K;
	std::string big[N], small[K];
	for (size_t i = 0; i < N; ++i) std::cin >> big[i];
	for (size_t i = 0; i < K; ++i) std::cin >> small[i];
	
	node trie;
	const node *query[K + 1];
	query[K] = nullptr;
	for (size_t i = 0; i < K; ++i) {
		node *n = &trie;
		for (auto &&ch : small[i]) {
			if (!n->children.contains(ch)) n->children[ch] = std::make_unique<node>();
			n = n->children[ch].get();
		}
		query[i] = n;
	}
	trie.back = &trie;
	std::queue<const node *> q;
	for (auto &&[ch, n] : trie.children) {
		n->back = &trie;
		q.push(n.get());
	}
	while (!q.empty()) {
		const node *p = q.front();
		q.pop();
		for (auto &&[ch, n] : p->children) {
			n->back = p->back->step(ch);
			q.push(n.get());
		}
	}
	
	const node *ends[N][N];
	for (size_t i = 0; i < N; ++i) {
		const node *n = &trie;
		for (size_t j = 0; j < N; ++j) {
			ends[i][j] = n = n->step(big[i][j]);
		}
	}
	
	size_t table[K + 1];
	table[1] = 0;
	size_t s = 0;
	for (size_t i = 2; i <= K; ++i) {
		table[i] = s = step(query, table, s, query[i - 1]);
	}
	
	for (size_t j = K - 1; j < N; ++j) {
		s = 0;
		for (size_t i = 0; i < N; ++i) {
			s = step(query, table, s, ends[i][j]);
			if (s == K) std::cout << (i - K + 1) << " " << (j - K + 1) << std::endl;
		}
	}
}