#include<bits/stdc++.h>
using namespace std;
#define int long long
#define base 1145141
#define mod 100000007
int n,q,l,r,fac1[1000005],fac2[1000005],P[1000005];
char s[1000005];
int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
		x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*f;
}
int calc1(int l,int r){
	return (fac1[r]-fac1[l-1]*P[r-l+1]%mod+mod)%mod;
}
int calc2(int l,int r){
	return (fac2[l]-fac2[r+1]*P[r-l+1]%mod+mod)%mod;
}
signed main(){
	n=read(),q=read();
	scanf("%s",s+1);
	P[0]=1;
	for(int i=1;i<=n;i++)
		P[i]=P[i-1]*base%mod;
	for(int i=1;i<=n;i++)
		fac1[i]=(fac1[i-1]*base+s[i]-'a'+1)%mod;
	for(int i=n;i;i--)
		fac2[i]=(fac2[i+1]*base+s[i]-'a'+1)%mod;
	while(q--){
		l=read(),r=read();
		puts(calc1(l,r)==calc2(l,r)||(r-l)%2?"Budada":"Putata");
	}
	return 0;
}