#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#define Min(a, b) a < b ? a : b
#define Max(a, b) a < b ? b : a
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = {0, 0, -1, 1};
const int dc[] = {-1, 1, 0, 0};
const double pi = acos(-1.0);
const double eps = 1e-8;
const int MAXN = 50 + 10;
const int MAXT = 2500 + 10;
using namespace std;
char a[MAXN][MAXN];
int x[MAXN][MAXN];
int y[MAXN][MAXN];
int mp[MAXT][MAXT];
bool used[MAXT];
int match[MAXT];
int m, n, cnt1, cnt2;
void deal_row(){cnt1 = 1;for(int i = 0; i < m; ++i){bool flag = false;for(int j = 0; j < n; ++j){if(a[i][j] == '*'){x[i][j] = cnt1;flag = true;}if(a[i][j] == '#'){++cnt1;flag = false;}}if(flag) ++cnt1;}
}
void deal_column(){cnt2 = 1;for(int i = 0; i < n; ++i){bool flag = false;for(int j = 0; j < m; ++j){if(a[j][i] == '*'){y[j][i] = cnt2;flag = true;}if(a[j][i] == '#'){++cnt2;flag = false;}}if(flag) ++cnt2;}
}
bool Find(int x){for(int i = 1; i < cnt2; ++i){if(mp[x][i] && !used[i]){used[i] = true;if(!match[i] || Find(match[i])){match[i] = x;return true;}}}return false;
}
void solve(){int cnt = 0;for(int i = 1; i < cnt1; ++i){memset(used, false, sizeof used);if(Find(i)) ++cnt;}printf("%d\n", cnt);
}
int main(){int T;scanf("%d", &T);while(T--){memset(a, 0, sizeof a);memset(x, 0, sizeof x);memset(y, 0, sizeof y);memset(mp, 0, sizeof mp);memset(match, 0, sizeof match);scanf("%d%d", &m, &n);for(int i = 0; i < m; ++i)scanf("%s", a[i]);deal_row();deal_column();for(int i = 0; i < m; ++i){for(int j = 0; j < n; ++j){if(a[i][j] == '*'){mp[x[i][j]][y[i][j]] = 1;}}}solve();}return 0;
}