//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;

deque<int> s1, s2; int k;

int qpow(int x, int y) {
	int res = 1;
	while(y) {
		if(y & 1) res = 1ll * res * x % mod;
		x = 1ll * x *x % mod , y>>= 1;
	} return res;
}

void solve() {
	s1.empty(), s2.empty();
	char c = getchar();
	while(c != '0' && c != '1') c = getchar();
	while(c == '0' || c == '1') {
		s1.push_back(c);
		c = getchar();
	}
	while(c != '0' && c != '1') c = getchar();
	while(c == '0' || c == '1') {
		s2.push_back(c);
		c = getchar();
	}
	k = ri();
	if(s1 == s2) {
		int ans = (qpow(4, k) + mod - 4) % mod;
		ans = 1ll * ans * qpow(3, mod - 2) % mod;
		cout << ans <<'\n';
		return;
	}
	int len = max(s1.size(), s2.size());
	if(len & 1) len++;
	while(s1.size() < len) s1.push_front('0');
	while(s2.size() < len) s2.push_front('0');
	vi s3, s4;
	s3.resize(len, 0);
	F(i, 0, len - 1) s3[i] = ((s1[i] - '0') ^ (s2[i] - '0'));
	F(i, 0, len - 1) {
		int w = (s3[i] * 2 + s3[i + 1]);
		++i;
//		Debug(w);
		s4.pb(w);
	}
	int ln = s4.size();
	int wk = 0;
	dF(i, ln - 1, 0) {
		if(s4[i]) break;
		wk++;
	}
	wk++;
	if(k > wk) {
		puts("-1");
		return;
	}
//	F(i, 0, ln - 1) {
//		if(s4[i] == 1) s4[i] = 1;
//		else if(s4[i] == 3) s4[i] = 2;
//		else if(s4[i] == 2) s4[i] = 3;
//		else s4[i] = 0;
//	}
//	reverse(s4.begin(), s4.end());
	int st = 000;
	int nw = 1;
	dF(i, ln - 1, 0) {
		if(s4[i] == 0);
		else if(s4[i] == 1) st = (st + 1ll * nw * 1) % mod;
		else if(s4[i] == 3) st = (st + 2ll * nw % mod) % mod;
		else if(s4[i] == 2) st = (st + 3ll * nw % mod) % mod;
		nw = 4ll * nw % mod;
		nw = (nw + 1) % mod;
//		Debug(i, nw, s4[i]);
	}
//	F(i, 0, ln - 1) {
//		Debug(i, s4[i]);
//		st = (5ll * st % mod + s4[i]) % mod;
//	}
//	int zkw = 0;
//	dF(i, ln - 1, 0) {
//		zkw = (4ll * zkw % mod + s4[i]) % mod;
//	}
//	Debug(zkw);
//	Debug(st);
	int ans = (qpow(4, k) + mod - 4) % mod;
	ans = 1ll * ans * qpow(3, mod - 2) % mod;
	ans = (ans + st) % mod;
	cout << ans << '\n';
}

bool Med;
signed main() {
	// Mry;
	int T = ri();
	while(T--) solve();
	// Try;
	return 0;
}

/*
4
1 10 1
1 10 2
100 0 2
11 11 3

1
110111 11111 1

110111
011111

101000
220
*/