#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,q;
char s[2000005],str[1000005];
int res[2][1000005],dp[2000005];

int chk(int l,int r){
	int pos = (l + r) / 2;
	if(l % 2 == r % 2) return res[0][pos] >= r - pos + 1;
	return res[1][pos] >= pos - l + 1;
}

int getres(int l,int r){
	assert(l % 2 != r % 2);
	int pos = (l + r) >> 1;
	if(s[pos] != s[pos + 1]) return 0;
	if(s[pos] == s[pos - 1] || s[pos] == s[pos + 2]) return 1;
	return 0;
}

int f(int l,int r){
	if(chk(l,r)) return 0;

	if(l % 2 != r % 2) return getres(l,r);
	int ans = 0;
	if(!chk(l + 1,r) && !getres(l + 1,r)) ans = 1;
	if(!chk(l,r - 1) && !getres(l,r - 1)) ans = 1;
	return ans;
}

int main(){
	scanf("%d%d",&n,&q);
	scanf("%s",str + 1);
	rep(i,1,n){
		s[2 * i - 1] = str[i];
		s[2 * i] = '*'; 
	}
	s[0] = '?';s[2 * n] = '!';
	int pos = 0,r = 0;
	rep(i,1,2 * n){
		if(i <= r) dp[i] = min(dp[2 * pos - i],r - i + 1);
		else dp[i] = 1;

		while(s[i - dp[i]] == s[i + dp[i]]) dp[i]++;

		if(i + dp[i] - 1 > r){
			pos = i;
			r = i + dp[i] - 1;
		}

		if(i % 2 == 1) res[0][i / 2 + 1] = (dp[i] + 1) / 2;
		else res[1][i / 2] = dp[i] / 2;
	}

	rep(i,1,q){
		int pl,pr;
		scanf("%d%d",&pl,&pr);
		if(f(pl,pr)) printf("Putata\n");
		else printf("Budada\n");
	}
	return 0;
}