#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, Q;
int A[MAX_N];
vector<int> G[MAX_N];
int to[MAX_N];

struct BIT { //0-origin!!! update and get just like lazy_segtree
	int n; vl bit0, bit1;
	void init(int mx) {
		n = mx;
		bit0 = vl(n + 1, 0); bit1 = vl(n + 1, 0);
	}

	ll ga(vl& bit, int i) {
		ll s = 0;
		while(i > 0) { s += bit[i]; i -= i & -i; }
		return s;
	}
	void app(vl& bit, int i, ll x) {
		while(i <= n) { bit[i] += x; i += i & -i; }
	}
	void update(int a, int b, ll x) { //[a, b)
		a++;
		app(bit0, a, -x * (a - 1));
		app(bit1, a, x);
		app(bit0, b + 1, x * b);
		app(bit1, b + 1, -x);
	}
	ll get(int a, int b) { //[a, b)
		a++;
		return (ga(bit1, b) * b + ga(bit0, b)) 
			- (ga(bit1, a - 1) * (a - 1) + ga(bit0, a - 1));
	}
};

struct mergeUF { //O((logn)^2)
	int n;
	vector<set<int>> g;
	vector<int> gat;

	int find(int p) {
		if(gat[p] == p) return p;
		else return gat[p] = find(gat[p]);
	}

	void init() {
		n = N / 2 + 1;
		g.resize(n); gat.resize(n);
		rep(i, 0, n) {
			rep(j, 0, sz(G[i])) {
				int v = G[i][j];
				g[i].insert(v);
			}
			gat[i] = i;
		}
	}


	void unite(int x, int y) {
		int a = find(x), b = find(y);
		if(a == b) return;
		if(sz(g[a]) > sz(g[b])) swap(a, b);
		gat[a] = b;

		for(int s : g[a]) {
			g[b].insert(s);
		}
		g[a].clear();
	}

	bool same(int x, int y) { return find(x) == find(y); }
	void show() {
		rep(i, 0, n) debug(i, vi(all(g[i])));
		debug(gat);
	}
};

mergeUF uf;
BIT bit;

void solve() {
	string str;
	cin >> str;
	N = sz(str);
	rep(i, 0, N) A[i] = str[i] - 'a';

	cin >> Q;
	rep(i, 0, Q) {
		int a, b;
		cin >> a >> b; a--; b--;
		int m1 = (N - 1) / 2, m2 = N / 2;
		if(a <= m1 && m2 <= b) {
			if(m1 - a <= b - m2) a = N - 1 - a + 1;
			else b = N - 1 - b - 1;
		}
		if(a >= m2) {
			int ta = a, tb = b;
			a = N - 1 - tb;
			b = N - 1 - ta;
		}
		b++;
		// debug(a, b);
		if(b > a) G[a].pb(b);
	}

	uf.init();
	bit.init(N / 2 + 10);

	rep(i, 0, N / 2) bit.update(i, i + 1, A[i]);
	memset(to, -1, sizeof(to));

	rep(i, 0, N / 2) {
		// rep(i, 0, N / 2) {
		// 	debug(i, vi(all(uf.g[i])), uf.gat[i]);
		// }
		int a = uf.find(i);
		if(uf.g[a].empty()) continue;
		// debug(i, vi(all(uf.g[a])));
		auto it = uf.g[a].begin();
		int tmp = *it;
		to[i] = tmp;
		uf.g[a].erase(it);
		uf.unite(i, tmp);
	}
	// debug(vi(to, to + N / 2 + 1));

	rep(i, 0, N / 2) {
		int a = bit.get(i, i + 1) % 26, b = A[N - 1 - i] % 26;
		if(to[i] == -1) {
			if(a != b) {
				cout << "NO\n";
				return;
			}
		}
		else {
			int t = (b - a + 26) % 26;
			bit.update(i, to[i], t);
		}
	}
	cout << "YES\n";

}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 15824