#include <iostream>
#include <vector>
using namespace std;

int m, n;

int PA[20][20], PB[20][20];

vector< pair<int, int> > results;

int main()
{
  while (true)
  {
    cin >> m;
    cin >> n;
    if ((m == 0) && (n == 0))
      break;

    for (int i = 0; i < m; ++i)
      for (int j = 0; j < n; ++j)
        cin >> PA[i][j];

    for (int i = 0; i < m; ++i)
      for (int j = 0; j < n; ++j)
        cin >> PB[i][j];

    results.clear();

    for (int i = 0; i < m; ++i)
      for (int j = 0; j < n; ++j)
      {
        int maxB = INT_MIN;
        for (int k = 0; k < n; ++k)
          if (PB[i][k] > maxB)
            maxB = PB[i][k];

        int maxA = INT_MIN;
        for (int k = 0; k < m; ++k)
          if (PA[k][j] > maxA)
            maxA = PA[k][j];

        if ((PA[i][j] == maxA) && (PB[i][j] == maxB))
          results.push_back(pair<int, int>(i, j));
      }

    cout << results.size() << endl;
    for (int i = 0; i < results.size(); ++i)
      cout << (results[i].first + 1) << " " << (results[i].second + 1) << endl;
  }
  return 0;
}