// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 2e6 + 10;
int n, q;
int rr[N];
void work(string ss) {
	string st = ""; st += '#';
	for (char i: ss) st += i, st += '#';
	int n = st.size(); st = '$' + st + '&';
	int pos, r = 0;
	F(i, 1, n) {
		if (r >= i) rr[i] = min(r - i, rr[pos * 2 - i]);
		while (st[i - rr[i] - 1] == st[i + rr[i] + 1]) rr[i]++;
		if (i + rr[i] > r) {
			pos = i;
			r = i + rr[i];
		}
	}
}
signed main() {
	string st;
	cin >> n >> q >> st;
	work(st);
	F(i, 1, q) {
		int l, r; read(l), read(r);
		if (rr[l + r] >= r - l + 1) puts("Budada");
		else if ((r - l) & 1) puts("Budada");
			else puts("Putata");
	}
	return 0;
}
/* why?
*/