Problem: Falling Block Puzzle

Block drop

You are playing a falling block puzzle. As shown in the figure below, the field of this puzzle has a shape in which cubic cells are arranged in 2 squares x 2 squares in each row, and the rows are infinitely arranged on the top.

<image>

Each cell either has one block that fits snugly in the cell, or nothing. This puzzle proceeds as follows.

1. Some blocks are installed in the initial state.
2. Drop a block that fits in 2 squares x 2 squares x 2 squares from above. However, before dropping, the block can be translated horizontally so that the block does not stick out of the field.
3. When the bottom surface of one of the dropped blocks reaches the bottom of the block or field that has already been placed, all the blocks will stop falling and stop.
4. For each stage, if all 4 squares are filled, the blocks in that stage will disappear, and the blocks above it will fall one by one. Even if there are no blocks in the cell below each block after the fall, it will not fall any further.
5. Return to 2.



Since the blocks placed in the initial state and some lumps to be dropped are given, create a program to find out how many steps can be erased by dropping all the lumps in the order given.

Input

The input consists of 100 or less datasets. Each dataset has the following form.

> (Initial block height H) (Number of lumps to drop N)
> (1st stage in the initial state)
> ...
> (H stage in the initial state)
> (1st drop)
> ...
> (Nth drop)

The first line of each dataset specifies the initial block height H (1 ≤ H ≤ 10) and the number of lumps to drop N (1 ≤ N ≤ 3). Then, the information of each stage in the initial state is given in the following format.

> c11 c12
> c21 c22

cij represents the information of each cell,'#' indicates that a block exists, and'.' Indicates that there is no block. It can be assumed that there are no blocks in all cells or no blocks in all cells for each of the first to H rows. Then, the information of each drop mass is given in the following format.

> b111 b112
> b121 b122
> b211 b212
> b221 b222

As in the initial state format,'#' indicates that a block exists, and'.' Indicates that there is no block. Each block contains at least one block. The blocks contained in the block may be touched only by the corners and sides, and are not necessarily connected by the surface.

Refer to the figure below for the correspondence of the input subscripts of the initial state and block block.

<image>

The end of the input is indicated by a single line of two zeros.

The figure below shows the first data set in the Sample Input shown later. In this dataset, one step can be erased by translating a block of blocks diagonally and then dropping them.

<image>

Output

For each dataset, output on one line how many columns can be erased at the maximum.

Sample Input


1 1

..
..
..
..
..
1 1
. #
..
..
..
..
. #
twenty two

..

..
..
. #

..
..
..
..
..
13
..
..












10 3

..

..

. #

. #
..

..

. #

. #

. #
..
. #
..
..
. #
..
. #
..
..
..
..
..
..
..
..
10 3

. #

..

..
. #
..

. #
. #

. #

..


. #
..
. #
..
..
. #
..
..
..
..
..
..
..
..
. #
0 0

Output for Sample Input


1
0
3
6
6
0





Example

Input

1 1
##
#.
..
..
#.
..
1 1
.#
#.
#.
..
..
.#
2 2
##
#.
##
#.
..
.#
##
#.
#.
..
#.
..
1 3
#.
..
##
##
##
##
##
##
##
##
##
##
##
##
10 3
##
#.
##
#.
##
.#
##
.#
#.
##
#.
##
.#
##
.#
##
.#
#.
.#
#.
#.
.#
#.
.#
#.
..
#.
..
#.
..
#.
..
10 3
##
.#
##
..
##
#.
.#
..
##
.#
.#
##
.#
##
#.
##
##
.#
..
.#
#.
#.
.#
#.
#.
#.
#.
..
..
..
..
.#
0 0


Output

1
0
3
6
6
0

Solution (in CPP):

Solution:
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;

vector<int> fall(vector<int> B, vector<int> A){
  int hb = B.size(), ha = A.size();
  B.push_back(0);
  B.push_back(0);
  for(int i = hb; i >= 0; --i){
    bool f = false;
    if(i > 0){
      for(int j = 0; j < ha; ++j){
        if(B[i-1+j]&A[j]){
          f = true;
          break;
        }
      }
    }else{
      f = true;
    }
    if(f){
      for(int j = 0; j < ha; ++j){
        B[i+j] |= A[j];
      }
      while(B.back() == 0) B.pop_back();
      return B;
    }
  }
  assert(false);
  return B;
}

int erase(vector<int>& B){
  vector<int> B_;
  int ret = 0;
  for(auto b : B){
    if(b == 15){
      ++ret;
      continue;
    }
    B_.push_back(b);
  }
  swap(B,B_);
  return ret;
}

// 0 1
// 2 3

int dfs(vector<int> B, const vector<vector<int>>& C, int idx){
  if(idx == C.size()) return 0;

  vector<int> c = C[idx];
  vector<vector<int>> c_(c.size());
  for(size_t i = 0; i < c.size(); ++i){
    for(int j = 0; j < 4; ++j){
      if((c[i]>>j)&1) c_[i].push_back(j);
    }
  }

  int ret = 0;
  int mask_x[] = {5,0,10}, mask_y[] = {3,0,12};
  int dx[] = {-1,0,1}, dy[] = {-2,0,2};
  for(int i = 0; i < 3; ++i){
    {
      bool f = true;
      for(auto e : c){
        if(e&mask_x[i]){
          f = false;
          break;
        }
      }
      if(!f) continue;
    }
    for(int j = 0; j < 3; ++j){
      {
        bool f = true;
        for(auto e : c){
          if(e&mask_y[j]){
            f = false;
            break;
          }
        }
        if(!f) continue;
      }
      vector<int> cc;
      for(auto e : c_){
        int t = 0;
        for(auto ee : e){
          ee += dx[i]+dy[j];
          t |= 1<<ee;
        }
        cc.push_back(t);
      }
      auto B_ = fall(B,cc);
      int ret_ = erase(B_);
      ret_ += dfs(B_,C,idx+1);
      ret = max(ret,ret_);
    }
  }
  return ret;
}

int main(){
  int H, N;
  while(cin >> H >> N, H){
    vector<int> B;
    for(int i = 0; i < H; ++i){
      int t = 0;
      for(int j = 0; j < 2; ++j){
        string s;
        cin >> s;
        for(int k = 0; k < 2; ++k){
          if(s[k] == '#')
            t |= 1<<(j*2+k);
        }
      }
      B.push_back(t);
    }
    vector<vector<int>> C;
    for(int i = 0; i < N; ++i){
      vector<int> b;
      for(int j = 0; j < 2; ++j){
        int t = 0;
        for(int k = 0; k < 2; ++k){
          string s;
          cin >> s;
          for(int l = 0; l < 2; ++l){
            if(s[l] == '#')
              t |= 1<<(k*2+l);
          }
        }
        if(t) b.push_back(t);
      }
      C.push_back(b);
    }
    int ans = dfs(B,C,0);
    cout << ans << endl;
  }
}