#include <bits/stdc++.h>

using namespace std;
using lli = long long;

template<int MOD>
class modint {
	int val;

public:
	modint(lli val = 0) : val (val % MOD) { }

	modint<MOD> operator+(const modint<MOD> &other) { return modint(val + other.val); }
	modint<MOD> operator-(const modint<MOD> &other) { return modint(val - other.val + MOD); }
	modint<MOD> operator*(const modint<MOD> &other) { return modint(1LL*val*other.val); }
	int operator()() { return val; }

	modint<MOD> pot(int n) {
		if (n == 0) return 1;

		auto x = pot(n/2);
		x = x*x;

		if (n%2 == 0) return x;
		return *this * x;
	}
};

using mint = modint<1000000007>;

int main() {
	int n, k;
	cin >> n >> k;

	if (k >= n) {
		cout << "0\n";
		return 0;
	}

	string s;
	cin >> s;

	vector<mint> dpB(n);

	{
		int cnt = 0; int cntW = 0; mint sum;
		for (int i = 0; i < k; ++i)
			if (s[i] == 'W') ++cntW;

		for (int i = k-1; i < n; ++i) {
			if (cntW == 0 && (i == k-1 || s[i - k] != 'B')) 
				dpB[i] = mint(2).pot(cnt) - sum;

			if (i - k >= 0) {
				if (s[i - k] == 'X') ++cnt;
				sum = sum*mint(2) + dpB[i - k];
			}
			if (s[i - (k - 1)] == 'W') --cntW;
			if (i < n && s[i + 1] == 'W') ++cntW;
		}
	}

	vector<mint> dpW(n);

	{
		int cnt = 0; int cntB = 0; mint sum;
		for (int i = n - 1; i >= n - k; --i)
			if (s[i] == 'B') ++cntB;

		for (int i = n - k; i >= 0; --i) {
			if (cntB == 0 && (i == n - k || s[i + k] != 'B')) 
				dpW[i] = mint(2).pot(cnt) - sum;

			if (i < n - k) {
				if (s[i + k] == 'X') ++cnt;
				sum = sum*mint(2) + dpW[i + k];
			}
			if (s[i + (k - 1)] == 'B') --cntB;
			if (i >= 0 && s[i - 1] == 'B') ++cntB;
		}
	}

	vector<mint> sumW(n + 1);

	for (int i = n-1; i >= 0; --i) 
		sumW[i] = sumW[i + 1]*mint(2) + dpW[i]; 
	
	mint ans;
	for (int i = 0; i < n; ++i)
		ans = ans + dpB[i]*sumW[i + 1];

	cout << ans() << "\n";
}