#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_map>
//#include"testlib.h"
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(s) s.rbegin(),s.rend()
#define RT(s) return cout<<s,0
#define sz(s)    (int)(s.size())
//#define PI acos(-1)
#define EPS 1e-8
#define watch(x) cout << (#x)<<" = "<<x<<endl
#define mk(x, y) make_pair(x, y)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
int dy[] = { 1, -1, 0, 0, -1, 1, 1, -1 };
int dx[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
void file() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	//freopen("C:\\Users\\karemo\\source\\repos\\generator\\generator\\out.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
#else
	//freopen("gcd.in", "r", stdin);
	//freopen("out.txt", "w", stdout);
#endif
}


void fast() {
	std::ios_base::sync_with_stdio(0);
	cin.tie(NULL);
}

int main() {
	file();
	fast();
	string str; cin >> str;
	str.insert(str.begin(), '0');
	int n = sz(str);
	vi p2(n + 1), val(n + 1);
	p2[0] = 1, val[0] = 0;
	for (int i = 1; i <= n; i++) {
		p2[i] = p2[i - 1] * 2 % 10;
		val[i] = val[i - 1] * 2 % 10;
		if (str[i] == '1')
			val[i] = (val[i] + 1) % 10;
	}
	int q; cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		int prev = val[l - 1];
		prev = prev * p2[r - l + 1] % 10;
		int num = (val[r] - prev + 10) % 10;
		cout << num << endl;
	}
	return 0;
}