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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define orange(...) safe
#define debug(...) safe
#endif

using lld = int64_t;

bool out = true;
bool fu;

void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m);
  for (int i = 0; i < m; i++) {
    cin >> a[i];
  }
	if (fu)
	{
		cout << n << ' ' << m << '\n';
for (int i = 0; i < m; i++) {
    cout << a[i] << '\n';
  }		
	}
  auto ans = vector(n, vector(m, 0));
  ans[0][0] = 1;

  const auto valid = [&](int value, bool construct = false) {
    vector<int> v(value, 1);


    for (int k = 0; k < m; k++) {

      int distinct = v.size();
      for (size_t i = 1; i < v.size(); i++)
        distinct -= v[i] == v[i - 1];

      int left = max(0, a[k] - distinct);

      vector<int> nv(value);
      for (int i = 0; i < value; i++) {
        int d = max(0, i ? v[i - 1] - v[i] - 1 : n + 1 - v[i] - 1);
        nv[i] = v[i] + min(left, d);
        left -= min(left, d);
      }
      if (left) {
        return false;
      }

      if (construct) {
        for (int i = 0; i < value; i++) {
          for (int j = v[i]; j <= nv[i]; j++) {
            ans[j - 1][k] = 1;
          }
        }
      }

      v = nv;
    }

    return true;
  };

  int l = 0, r = n;

  while (r - l > 1) {
    int m = (l + r) / 2;
    if (valid(m)) {
      r = m;
    } else {
      l = m;
    }
  }

  valid(r, true);

  
  for (int j = 0; j < m; j++) {
    for (int i = 0; i < n; i++) {
      if (ans[i][j]) {
        a[j]--;
        if (a[j] < 0) ans[i][j] = 0;
      }
    }
  }
if (out)
{
	cout << r << '\n';
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << ".#"[ans[n - 1 - i][j]];
    }
    cout << '\n';
  }
}
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int T;
  cin >> T;
  if (T >= 196) out = false;
  int cnt = 0;
  while (T--)
  {
  	++cnt;
  	if (cnt == 196) out = fu = true;
    solve();
	}
  return 0;
}