Problem:
Pattern Search

Find places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.

Input

In the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.

In the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.

output

For each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.

Constraints

1 ≤ H, W ≤ 1000

1 ≤ R, C ≤ 1000

The input consists of alphabetical characters and digits

Sample Input 1

4 5
00010
00101
00010
00100
3 2
10
01
10

Sample Output 1

0 3
1 2

Solution in Ruby (judge verdict: Runtime Error)

h, w = gets.split.map(&:to_i)
hw = {}
h.times{|i|
  hw[i] = gets.chomp
}
r, c = gets.split.map(&:to_i)
rc = []
r.times{|i|
  rc[i] = gets.chomp
}

exit if r > h || c > w

hash = Hash.new { |ha,k| ha[k] = Hash.new(&ha.default_proc) }

0.upto(w-c){|j|
#  p j
  str = []
  r.times{|i|
    if i == 0
      str = [hw[i][j,c]]
    else
      str.push(hw[i][j,c])
    end
  }
  (h-r).times{|i|
    hash[str.join][i][j] = 1
    str.shift()
    str.push(hw[i+r][j,c])
  }
  hash[str.join][h-r][j] = 1
}

it = rc.join
if hash[it] then
  hash[it].sort.each{|i, val|
    hash[it][i].sort.each{|j, v|
      puts "#{i} #{j}"
    }
  }
end