#include<iostream>

 #include<algorithm>

 using namespace std;

 const int maxn =  + ;

 char str[maxn];

 int n, L;

 int sum[maxn];

 int q[maxn];

 int front, rear;

 double cacl(int a, int b)   //计算斜率

 {

     return (double)(sum[b]-sum[a]) / (b-a);

 }

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int t;

     cin >> t;

     while (t--)

     {

         cin >> n >> L >> str;

         sum[] = ;

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

             sum[i] = sum[i - ] + str[i - ] - '';

         front = rear = -;

         int start = , end = L,len=;

         double ans = ;

         //因为长度至少为L，所以从L开始

         for (int t = L; t <= n; t++)    //t为线段右端点

         {

             int j = t - L;   //j为线段左端点

             //如果rear-1，rear和j是上凸点，那么删去上凸点rear

             while (front < rear && cacl(q[rear],j) <= cacl(q[rear - ], q[rear]))  rear--;

             //加入j

             q[++rear] =j;

             //第一个和t的斜率小于等于第二个和t的斜率，那么肯定取第二个，删去第一个

             while (front < rear && cacl(q[front], t) <= cacl(q[front + ], t))    front++;

             //由上一步可得出t和q[front]斜率，这也就是t所能组成的最大斜率

             double m = cacl(q[front], t);

             int l = t - q[front] + ;

             if (m == ans && l<len || m>ans)

             {

                 ans = m;

                 len = l;

                 start = q[front];

                 end = t;

             }

         }

         cout << start +  << " " << end << endl;

     }

     return ;

 }