#include <cstdio>

#include <cstring>

#include <iostream>

#include <queue>

#include <map>

#include <stack>

#include <algorithm>

using namespace std;

int dp[];

int LIS(int a[],int len)

{

    int ret=;

    memset(dp,,sizeof(dp));

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

    {

        if(a[i] > dp[ret]) dp[++ret]=a[i];

        else

        {

            int pos=lower_bound(dp+,dp+ret,a[i])-dp;

            dp[pos]=a[i];

        }

    }

    return ret;

}

int b[],c[];

int main()

{

    int t;

    scanf("%d",&t);

    while(t--)

    {

        int n,k;

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

        int pos=n-;

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

        {

            scanf("%d",&b[i]);

            c[pos--]=b[i];

        }

        int mx=max(LIS(c,n),LIS(b,n));

        if(n-mx<=k) cout<<"A is a magic array."<<endl;

        else cout<<"A is not a magic array."<<endl;

    }

    return;

}