程序代码：

#include <iostream>
using namespace std;

class Node
{
      private:
              int flag[1001];
              int n,m;
      public:
             void init()
             {
                  int j;
                  cin>>n>>m;
                  for (int i=1; i<=n; i++) flag[i]=0;
                  for (int i=1; i<=m; i++) flag[cin>>j,j]=1;
             }
             
             void printans()
             {
                  int ans=0,state=0,last;
                  for (int i=n; i>=1; i--)
                  if (flag[i])
                  {
                      state++; 
                      if (state==1) last=i;
                      if (state==7)
                      {
                                    ans+=47+state*4+last+last;
                                    state=0;
                      }
                  }
                  if (state!=0) ans+=47+state*4+last+last;
                  
                  state=0;
                  for (int i=n; i>=1; i--)
                  if (!flag[i])
                  {
                      state++; 
                      if (state==1) last=i;
                      if (state==7)
                      {
                                    ans+=47+state*4+last+last;
                                    state=0;
                      }
                  }
                  if (state!=0) ans+=47+state*4+last+last;
                  
                  cout<<ans<<endl;
             }
};

int main()
{
    int time;
    Node p;
    
    cin>>time;
    while (time--)
    {
          p.init();
          p.printans();
    }
}