#include <bits/stdc++.h>
using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = int64_t;

#define fs first
#define sc second

const int64_t MOD = 1e9+7;
int dy[] = {0, 0, 1, 0,-1, 1, 1,-1,-1},
    dx[] = {0, 1, 0,-1, 0, 1,-1, 1,-1};

struct Block {
    vector<vector<vector<char>>> data;
    Block() : data(make_vector<char>(2,2,2,'.')) {}

    friend ostream& operator<<(ostream& os, const Block& b) {
        os << endl;
        for (int k = 0; k < 2; ++k) {
            for (int i = 0; i < 2; ++i) {
                for (int j = 0; j < 2; ++j) {
                    os << b.data[k][i][j];
                }
                os << endl;
            }
            os << endl;
        }
        return os;
    }

    pair<Block, bool> shift(int dir) const {
        bool valid = true;
        Block ret;
        for (int k = 0; k < 2; ++k) {
            for (int i = 0; i < 2; ++i) {
                for (int j = 0; j < 2; ++j) {
                    int y = i + dy[dir], x = j + dx[dir];
                    if (y < 0 or 2 <= y or x < 0 or 2 <= x) {
                        if (data[k][i][j] == '#') {
                            valid = false;
                        }
                    } else {
                        ret.data[k][y][x] = data[k][i][j];
                    }
                }
            }
        }
        return { ret, valid };
    }
};

struct Board {
    vector<vector<vector<char>>> data;
    Board() {}
    Board(int k) : data(k, make_vector<char>(2,2,'.')) {}

    friend ostream& operator<<(ostream& os, const Board& b) {
        os << endl;
        for (int k = 0; k < b.data.size(); ++k) {
            for (int i = 0; i < 2; ++i) {
                for (int j = 0; j < 2; ++j) {
                    os << b.data[k][i][j];
                }
                os << endl;
            }
            os << endl;
        }
        return os;
    }

    pair<Board,int> clear() const {
        Board ret = Board(data.size());
        int height = 0, count = 0;
        for (int k = 0; k < data.size(); ++k) {
            if (data[k][0][0] == '#' and data[k][0][1] == '#' and
                data[k][1][0] == '#' and data[k][1][1] == '#') {
                ++count;
                continue;
            }
            for (int i = 0; i < 2; ++i) {
                for (int j = 0; j < 2; ++j) {
                    ret.data[height][i][j] = data[k][i][j];
                }
            }
            ++height;
        }
        return { ret, count };
    }

    Board drop(const Block& block) const {
        Board ret = *this;
        auto height = make_v<int>(2, 2);
        for (int i = 0; i < 2; ++i) {
            for (int j = 0; j < 2; ++j) {
                for (int k = 0; k < data.size(); ++k) {
                    if (data[k][i][j] == '#') {
                        chmax(height[i][j], k+1);
                    }
                }
            }
        }

        int floor = -1;
        for (int i = 0; i < 2; ++i) {
            for (int j = 0; j < 2; ++j) {
                if (block.data[0][i][j] == '#') {
                    chmax(floor, height[i][j]);
                } else if (block.data[1][i][j] == '#') {
                    chmax(floor, height[i][j] - 1);
                }
            }
        }

        for (int k = 0; k < 2; ++k) {
            for (int i = 0; i < 2; ++i) {
                for (int j = 0; j < 2; ++j) {
                    if (block.data[k][i][j] == '#') {
                        ret.data[k + floor][i][j] = '#';
                    }
                }
            }
        }

        return ret;
    }
};

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    while (true) {
        int H, N; cin >> H >> N;
        if (H == 0) break;
        Board board(H + 2*N);
        for (int k = 0; k < H; ++k) {
            for (int i = 0; i < 2; ++i) {
                string s; cin >> s;
                for (int j = 0; j < 2; ++j) {
                    board.data[k][i][j] = s[j];
                }
            }
        }

        vector<Block> blocks(N);
        for (int t = 0; t < N; ++t) {
            for (int k = 0; k < 2; ++k) {
                for (int i = 0; i < 2; ++i) {
                    string s; cin >> s;
                    for (int j = 0; j < 2; ++j) {
                        blocks[t].data[k][i][j] = s[j];
                    }
                }
            }
        }

        vector<int> a(N+1);
        int ans = 0;
        while (!a[N]) {
            Board tmp = board;
            bool valid = true;
            int count = 0;
            for (int t = 0; t < N; ++t) {
                bool ok; Block block;
                tie(block, ok) = blocks[t].shift(a[t]);
                if (!ok) {
                    valid = false;
                    break;
                }
                tmp = tmp.drop(block);
                int cnt;
                tie(tmp, cnt) = tmp.clear();
                count += cnt;
            }
            if (valid) chmax(ans, count);
            for (int i = 0; ++a[i] == 9; ++i) a[i] = 0;
        }
        cout << ans << endl;
    }

    return 0;
}



Measured memory_bytes: 3092