#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;

#define rep(i, init, end) for(ll i = init; i < end; i++)
#define REP(i, init, end) for(ll i = init; i < end + 1; i++)
#define rev(i, end, init) for(ll i = init - 1; i >= end; i--)
#define REV(i, end, init) for(ll i = init; i >= end; i--)
#define PI 3.14159265359
// #define EPS 0.0000000001
#define MOD 1000000007
//cout << std::fixed << std::setprecision(15) << y << endl;


#define INF 1 << 30

int main(){
    ll H, W;
    cin >> H >> W;

    string A[H];
    rep(i, 0, H){
        cin >> A[i];
    }

    ll diff = 0;
    ll dp[H][W];
    rep(i, 0, H){
        rep(j, 0, W){
            dp[i][j] = INF;
        }
    }
    dp[H - 1][W - 1] = 0;

    rev(i, 0, H){
        rev(j, 0, W){
            if(i == H - 1 && j == W - 1){
                continue;
            }

            if(i == H - 1){
                if((i + j) % 2 == 1){
                    dp[i][j] = (A[i][j + 1] == '+' ? -1 : 1) + dp[i][j + 1];
                }else{
                    dp[i][j] = (A[i][j + 1] == '+' ? 1 : -1) + dp[i][j + 1];
                }
            }else if(j == W - 1){
                if((i + j) % 2 == 1){
                    dp[i][j] = (A[i + 1][j] == '+' ? -1 : 1) + dp[i + 1][j];
                }else{
                    dp[i][j] = (A[i + 1][j] == '+' ? 1 : -1) + dp[i + 1][j];
                }
            }else{
                if((i + j) % 2 == 1){
                    dp[i][j] = min((A[i][j + 1] == '+' ? -1 : 1) + dp[i][j + 1], (A[i + 1][j] == '+' ? -1 : 1) + dp[i + 1][j]);
                }else{
                    dp[i][j] = max((A[i][j + 1] == '+' ? 1 : -1) + dp[i][j + 1], (A[i + 1][j] == '+' ? 1 : -1) + dp[i + 1][j]);
                }
            }
        }
    }

    if(dp[0][0] > 0){
        cout << "Takahashi" << endl;
    }else if(dp[0][0] < 0){
        cout << "Aoki" << endl;
    }else{
        cout << "Draw" << endl;
    }

    return 0;
}

//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
 
#include <bits/stdc++.h>
 
// #include <atcoder/all>
 
using namespace std;
// using namespace atcoder;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}
void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}
void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}
void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}
void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}
void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

void solve(vector<pii> wv, vi x) {
    sort(all(x));

    ll ans = 0;
    for (pii temp: wv) {
        int w = temp.first, v = temp.second;
        rep (i, x.size()) {
            if (x[i] >= w) {
                ans += v;
                x.erase(x.begin() + i);
                break;
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<pii> wv(n);
    rep (i, n) {
        cin >> wv[i].first >> wv[i].second;
    }
    sort(all(wv), [&](pii a, pii b) {
        return a.second > b.second;
    });

    vi x(m);
    rep (i, m) cin >> x[i];

    while (q--) {
        vi X;
        int l, r;
        cin >> l >> r;
        l--;
        rep (i, m) {
            if (in(i, l, r)) continue;
            X.push_back(x[i]);
        }

        solve(wv, X);
    }
}