#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
void _main();
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	_main();
	return 0;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<ll>;
using vii = std::vector<pair<int, int> >;
using vvl = std::vector<vl>;
using vll = std::vector<pair<ll , ll> >;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using vs = std::vector<std::string>;
using vvs = std::vector<vs>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using vc = std::vector<char>;
using vvc = std::vector<vc>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using piil = std::pair<pair<int, int>, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
using pql = std::priority_queue<ll>;
using pqi = std::priority_queue<int>;
using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;
using pqii = std::priority_queue<pair<int, int> >;

#define pb push_back
#define ps push
#define eb emplace_back
#define is insert
#define er erase
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sf(i) sizeof(i)
#define endl "\n"
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, L, R) for(ll i = L;i<=R;i++)
#define pcis precision

template<typename T>
struct infinity {
	static constexpr T max=std::numeric_limits<T>::max();
	static constexpr T min=std::numeric_limits<T>::min();
	static constexpr T value=std::numeric_limits<T>::max()/2;
	static constexpr T mvalue=std::numeric_limits<T>::min()/2;
};
template<typename T>constexpr T INF=infinity<T>::value;
constexpr ll lINF=INF<ll>;
constexpr int iINF = INF<int>;
constexpr ld PI = 3.1415926535897932384626;



void _main() {

	ll N, Q;
	cin >>N >>Q;
	ll A[N+1];
	for (ll i = 1; i<=N; i++)cin>>A[i];
	ll S1[N+1];
	ll S2[N+1];
	ll S3[N+1];
	memset(S1, 0 ,sf(S1));
	memset(S2, 0 ,sf(S2));
	memset(S3, 0 ,sf(S3));

	for (ll i = 1; i<=N; i++) if (A[i] == 9)S1[i] ++;
	for (ll i = 1; i<=N; i++)if (A[i]==1)S2[i]++;
	for (ll i = 1; i<=N; i++) {
		if (A[i]==1) {
			S3[i] += i;
		}
	}

	for (ll i = 1; i<=N; i++) {
		S1[i] += S1[i-1];
	}

	for (ll i = 1; i<=N; i++) {
		S2[i] += S2[i-1];
	}
	for (ll i = 1; i<=N; i++) {
		S3[i] += S3[i-1];
	}


	while (Q--) {
		ll a, b;
		cin >>a>>b;
		cout << (S1[b]-S1[a-1]) + ((S2[b]-S2[a-1])*b - (S3[b] - S3[a-1])) << endl;
	}






}