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

struct coord {
    int h, x, y;
    coord() {}
    coord(int a, int b, int c) : h(a), x(b), y(c) {}
};

struct block {
    int h;
    vector<coord> elems;
    block() {}

    block move(int dx, int dy) {
        block ret;
        ret.h = h;
        ret.elems = elems;
        for (coord& e : ret.elems) {
            e.x += dx;  e.y += dy;
        }
        return ret;
    }
};

const int LIM = 20;

int H, N;
block B[3];

char field[LIM+5][2][2], field_bak[LIM+5][2][2];

int drop(block b) {
    while (b.h >= 0) {
        bool overlap = false;
        for (coord c : b.elems) {
            if (field[b.h+c.h][c.x][c.y])
                overlap = true;
        }
        if (overlap) break;
        b.h -= 1;
    }
    b.h += 1;

    for (coord c : b.elems) field[b.h+c.h][c.x][c.y] = 1;

    int delete_count = 0;

    for (int h = 0; h < 20; ++h) {
        int count = 0;
        for (int x = 0; x < 2; ++x) {
            for (int y = 0; y < 2; ++y) {
                if (field[h][x][y] == 1) ++count;
            }
        }
        if (count == 4) {
            ++delete_count;
            for (int hh = h+1; hh < 20; ++hh) {
                for (int x = 0; x < 2; ++x) {
                    for (int y = 0; y < 2; ++y) field[hh-1][x][y] = field[hh][x][y];
                }
            }
            for (int x = 0; x < 2; ++x)
                for (int y = 0; y < 2; ++y) field[19][x][y] = 0;

            --h;
        }
    }

    return delete_count;
}

vector<block> dropped;
int br(int idx) {
    if (idx >= N) {
        for (int i = 0; i < 20; ++i)
            for (int j = 0; j < 2; ++j)
                for (int k = 0; k < 2; ++k) field[i][j][k] = field_bak[i][j][k];

        int ans = 0;
        for (int i = 0; i < N; ++i)
            ans += drop(dropped[i]);

        return ans;
    }

    int ans = 0;
    int lim_x = 0, lim_y = 0;
    for (coord c : B[idx].elems) {
        lim_x = max(lim_x, c.x); lim_y = max(lim_y, c.y);
    }
    lim_x = 2 - lim_x; lim_y = 2 - lim_y;

    for (int dx = 0; dx < lim_x; ++dx) {
        for (int dy = 0; dy < lim_y; ++dy) {
            dropped[idx] = B[idx].move(dx, dy);
            ans = max(ans, br(idx+1));
        }
    }

    return ans;
}

int solve() {
    dropped.resize(N);

    for (int i = 0; i < N; ++i)
        B[i].h = 20;

    for (int i = 0; i < 20; ++i)
        for (int j = 0; j < 2; ++j)
            for (int k = 0; k < 2; ++k) field_bak[i][j][k] = field[i][j][k];

    return br(0);
}

int main() {
    while (true) {
        cin >> H >> N;
        if (H == 0 && N == 0) break;
        for (int i = 0; i < LIM+5; ++i)
            for (int j = 0; j < 2; ++j) fill(field[i][j], field[i][j]+2, 0);

        for (int i = 0; i < H; ++i) {
            string c[2]; cin >> c[0] >> c[1];
            for (int j = 0; j < 2; ++j)
                for (int k = 0; k < 2; ++k)
                    field[i][j][k] = (c[j][k] == '#') ? 1 : 0;
        }
        for (int i = 0; i < N; ++i) {
            B[i].elems.clear();
            int lx = 2, ly = 2, lh = 2;
            for (int j = 0; j < 2; ++j) {
                for (int k = 0; k < 2; ++k) {
                    string c; cin >> c;
                    for (int l = 0; l < 2; ++l) {
                        if (c[l] == '#') {
                            B[i].elems.emplace_back(j, k, l);
                            lx = min(lx, k); ly = min(ly, l); lh = min(lh, j);
                        }
                    }
                }
            }

            for (coord& c : B[i].elems) {
                c.x -= lx; c.y -= ly; c.h -= lh;
            }
        }

        cout << solve() << endl;
    }
    return 0;
}



Measured memory_bytes: 3116