#include<cstdio>

 #include<cmath>

 #include<algorithm>

 #include<cstring>

 #include<string>

 #include<iostream>

 #include<map>

 #include<vector>

 #include<set>

 #include<queue>

 using namespace std;

 const int inf = 0x3f3f3f3f;

 long long int a[];

 int main()

 {

     int n, m;

     scanf("%d %d", &n, &m);

     a[] = ;

     for (int i = ; i <= n; i++)

     {

         long long int tmp;

         cin >> tmp;

         a[i] = tmp + a[i - ];

     }

     long long int now = ;

     for (int i = ; i < m; i++)

     {

         long long int b;

         cin >> b;

         for (; now <= n;now++)

         {

             if (a[now] >= b)

             {

                 cout << now << " " << b - a[now - ] << endl;

                 break;

             }

         }

     }

     return ;

 }