#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b>>1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;



vector<vector<ll>> g;

vector<ll> see;

bool nibu(ll u) {
	
	bool ret = 1;

	for (ll v : g[u]) {
		if (see[v] != -1) {
			if (see[v] == see[u]) { ret = 0; }
		}
		else {
			see[v] = (see[u] + 1) % 2;
			ret = nibu(v);
		}
	}

	return ret;
}

ll wa(ll u,vector<ll> &b) {
	ll ret = b[u];
	see[u] = 2;

	for (ll v : g[u]) {
		if (see[v] == 2) { continue; }
		ret += wa(v,b);
	}

	return ret;
}

int main() {
	string S;
	cin >> S;
	ll T = S.size();
	
	ll M = T / 2 + 1;
	vector<ll> a(M + 1, 0);
	repn(i, M - 1) {
		a[i] = (ll)S[T - i] - (ll)S[i - 1];
		if (a[i] < 0) { a[i] += 26; }
	}

	vector<ll> b(M + 1, 0);
	repn(i, M)b[i] = a[i] - a[i - 1];

	//repn(i, M)cout << b[i] << " ";
	//cout << endl;

	g.resize(M + 1);
	ll N;
	cin >> N;

	repn(i, N) {
		ll l, r;
		cin >> l >> r;

		if (l + r == T + 1) { continue; }

		if (r <= T / 2) { r++; }
		else if (l + r < T + 1) { r = T - r + 1; }
		else if (l <= T / 2) { r = T - r + 1; swap(l, r); }
		else { l = T - l + 1 + 1; r = T - r + 1; swap(l, r); }

		if (l > M) { l--; }
		if (r > M) { r--; }

		g[l].push_back(r);
		g[r].push_back(l);

		//cout << l << " " << r << endl;
	}

	see.assign(M + 1, -1);

	string ans = "YES";

	repn(u, M) {
		if (see[u] != -1) { continue; }
		see[u] = 0;

		bool nb = nibu(u);
		ll ss = wa(u, b);
		if (ss%26 != 0) { ans = "NO"; }

		//cout << u << " " << nb << " " << ss << endl;
	}

	cout << ans << endl;
}


Measured memory_bytes: 7296