#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  string s;
  cin >> s;
  reverse(s.begin(), s.end());
  s.pop_back(), s.pop_back();
  reverse(s.begin(), s.end());
  string cc;
  while (s.back() != 'x') {
    cc += s.back();
    s.pop_back();
  }
  s.pop_back();
  reverse(cc.begin(), cc.end());
  int x = 1, c = 0;
  if (!s.empty()) { 
    if (s.size() > 1) {
      x = s[1] - '0';
      if (s[0] == '-') {
        x = -x;
      }
    } else {
      if (s[0] == '-') {
        x = -x;
      } else {
        x = s[0] - '0';
      }
    }
  }
  if (cc.size()) {
    c = stoi(cc);
  }
  int q;
  cin >> q;
  while (q--) {
    int X, Y;
    cin >> X >> Y;
    if (X * x + c == Y) cout << "YES\n";
    else cout << "NO\n";
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  // cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}