#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
typedef unsigned long long ull;

constexpr int N = 2e6, P = 13331;
int a[N];
ull ha[N], revha[N], p[N];

ull getha(int l, int r){
    return ha[r] - ha[l - 1] * p[r - l + 1];
}

ull getrevha(int l, int r){
    return revha[r] - revha[l - 1] * p[r - l + 1];
}

void solve(){
    int n, q;
    cin >> n >> q;
    string s, rev;
    cin >> s;
    rev = s;
    s = " " + s;
    reverse(rev.begin(), rev.end());
    rev = " " + rev;
    p[0] = 1;
    for(int i = 1; i <= n; i ++){
        ha[i] = ha[i - 1] * P + s[i];
        p[i] = p[i - 1] * P;
    }
    for(int i = 1; i <= n; i ++){
        revha[i] = revha[i - 1] * P + rev[i];
    }

    while(q --){
        int l, r;
        cin >> l >> r;
        if(getha(l, r) == getrevha(n - r + 1, n - l + 1))
            cout << "Budada" << endl;
        else{
            if((r - l + 1) % 2)
                cout << "Putata" << endl;
            else
                cout << "Budada" << endl;
        }
    }
}

signed main(){
    cin.tie(nullptr) -> ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while(t --)
        solve();
    return 0;
}