ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2060D - Subtract Min Sort
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
//#include <bits/stdc++.h>

//using namespace std;

//

//

//void solve(){

//  int n;

//  cin>>n;

//  vector<int>a(n);

//  for(int i=0;i<n;++i) cin>>a[i];

//  int last=0;

//  int p=0;

//  int ans=1;

//  int gap;

//  while(p<n){

//    if(a[p]>=last){

//      gap=a[p]-last;

//      last=a[p];

//    }

//    else if(a[p]>=gap){

//        last=gap;

//        gap=a[p]-last;

//    }

//    else ans=0;

//    p++;

//  }

//  cout<<(ans?"YES\n":"NO\n");

//}

//int main(){

//  int t;

//  cin>>t;

//  while(t--) solve();

//  return 0;

//}



#include <bits/stdc++.h>

using namespace std;





void solve(){

  int n;

  cin>>n;

  vector<int>a(n);

  for(int i=0;i<n;++i) cin>>a[i];

  int ans=1;

  vector<int>v;

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

    if(v.empty()){

      v.push_back(a[i]);

    }

    else if(a[i]>=v.back()){

      v.push_back(a[i]);

    }

    else{

      int tt=v.back()-v.front();

      if(a[i]>=tt){

        v.clear();

        v.push_back(tt);

        v.push_back(a[i]);

      }

      else{

        ans=0;

      }

    }

  }

  cout<<(ans?"YES\n":"NO\n");

}

int main(){

  int t=1;

  cin>>t;

  while(t--) solve();

  return 0;

}



Submission (verdict: Accepted):
//#include <bits/stdc++.h>

//using namespace std;

//

//

//void solve(){

//  int n;

//  cin>>n;

//  vector<int>a(n);

//  for(int i=0;i<n;++i) cin>>a[i];

//  int last=0;

//  int p=0;

//  int ans=1;

//  int gap;

//  while(p<n){

//    if(a[p]>=last){

//      gap=a[p]-last;

//      last=a[p];

//    }

//    else if(a[p]>=gap){

//        last=gap;

//        gap=a[p]-last;

//    }

//    else ans=0;

//    p++;

//  }

//  cout<<(ans?"YES\n":"NO\n");

//}

//int main(){

//  int t;

//  cin>>t;

//  while(t--) solve();

//  return 0;

//}



#include <bits/stdc++.h>

using namespace std;





void solve(){

  int n;

  cin>>n;

  vector<int>a(n);

  for(int i=0;i<n;++i) cin>>a[i];

  int ans=1;

  vector<int>v;

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

    if(v.empty()){

      v.push_back(a[i]);

    }

    else if(a[i]>=v.back()){

      int t=a[i]-v.back();

      v.clear();

      v.push_back(t);

//      v.push_back(a[i]);

    }

  else ans=0;

//    else{

//      int tt=v.back()-v.front();

//      if(a[i]>=tt){

//        v.clear();

//        v.push_back(tt);

//        v.push_back(a[i]);

//      }

//      else{

//        ans=0;

//      }

//    }

  }

  cout<<(ans?"YES\n":"NO\n");

}

int main(){

  int t=1;

  cin>>t;

  while(t--) solve();

  return 0;

}
Problem: 2060D - Subtract Min Sort
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>

using namespace std;





void solve(){

  int n;

  cin>>n;

  vector<int>a(n);

  for(int i=0;i<n;++i) cin>>a[i];

  int last=0;

  int p=0;

  int ans=1;

  int gap;

  while(p<n){

    if(a[p]>=last){

      gap=a[p]-last;

      last=a[p];

    }

    else if(a[p]>=gap){

        last=gap;

        gap=a[p]-last;

    }

    else ans=0;

    p++;

  }

  cout<<(ans?"YES\n":"NO\n");

}

int main(){

  int t;

  cin>>t;

  while(t--) solve();

  return 0;

}



Submission (verdict: Wrong answer on test 2):
//#include <bits/stdc++.h>

//using namespace std;

//

//

//void solve(){

//  int n;

//  cin>>n;

//  vector<int>a(n);

//  for(int i=0;i<n;++i) cin>>a[i];

//  int last=0;

//  int p=0;

//  int ans=1;

//  int gap;

//  while(p<n){

//    if(a[p]>=last){

//      gap=a[p]-last;

//      last=a[p];

//    }

//    else if(a[p]>=gap){

//        last=gap;

//        gap=a[p]-last;

//    }

//    else ans=0;

//    p++;

//  }

//  cout<<(ans?"YES\n":"NO\n");

//}

//int main(){

//  int t;

//  cin>>t;

//  while(t--) solve();

//  return 0;

//}



#include <bits/stdc++.h>

using namespace std;





void solve(){

  int n;

  cin>>n;

  vector<int>a(n);

  for(int i=0;i<n;++i) cin>>a[i];

  int ans=1;

  vector<int>v;

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

    if(v.empty()){

      v.push_back(a[i]);

    }

    else if(a[i]>=v.back()){

      v.push_back(a[i]);

    }

    else{

      int tt=v.back()-v.front();

      if(a[i]>=tt){

        v.clear();

        v.push_back(tt);

        v.push_back(a[i]);

      }

      else{

        ans=0;

      }

    }

  }

  cout<<(ans?"YES\n":"NO\n");

}

int main(){

  int t=1;

  cin>>t;

  while(t--) solve();

  return 0;

}
Problem: 2060D - Subtract Min Sort
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 2):
#include <bits/stdc++.h>

using namespace std;





void solve(){

  int n;

  cin>>n;

  vector<int>a(n);

  for(int i=0;i<n;++i) cin>>a[i];

  int last=0;

  int p=0;

  int ans=1;

  int gap;

  while(p<n){

    if(a[p]>=last){

      gap=a[p]-last;

      last=a[p];

    }

    else if(a[p]>=gap){

        last=gap;

        gap=a[p]-last;

    }

    else ans=0;

    p++;

  }

  cout<<(ans?"YES\n":"NO\n");

}

int main(){

  int t;

  cin>>t;

  while(t--) solve();

  return 0;

}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        map<int,int>mpp;
        priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            // if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i+1;j<min(n,(s[i]-'0')+10);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}

Submission (verdict: Accepted):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        // map<int,int>mpp;
        // priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            // if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i;j<min(n,i+10);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        map<int,int>mpp;
        priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i+1;j<min(n,(s[i]-'0')+9);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        map<int,int>mpp;
        priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i+1;j<min(n,(s[i]-'0')+9);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}

Submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        map<int,int>mpp;
        priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            // if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i+1;j<min(n,(s[i]-'0')+9);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}
Problem: 2050D - Digital string maximization
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        map<int,int>mpp;
        priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            // if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i+1;j<min(n,(s[i]-'0')+9);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}

Submission (verdict: Wrong answer on test 3):
#include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
    int t=1;
    cin>>t;
    while(t--){
    //    int n;
    //    cin>>n;
        string s;
        cin>>s;
        int n=s.size();
        map<int,int>mpp;
        priority_queue<char>pq;
        r(i,n){
            int maxi=0,ind=i;
            // if(!mpp[i])
            maxi=s[i]-'0';
            for(int j=i+1;j<min(n,(s[i]-'0')+10);j++){
                if((s[j]-'0')-(j-i)>maxi){
                    maxi=(s[j]-'0')-(j-i);
                    ind=j;
                }
            }
        while(ind>i){
            swap(s[ind],s[ind-1]);
            ind--;
        }
         s[i]=(maxi+'0');
        }
    cout<<s<<endl;

    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

Previous submission (verdict: Compilation error):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
     for(int ii=1;i<=tc;ii++)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        if(ii==80)
        {
            for(int i=0;i<n;i++) cout<<v[i]<<" ";
            cout<<endl;
            return 0;
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}


Submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
     for(int ii=1;ii<=tc;ii++)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        if(ii==80)
        {
            for(int i=0;i<n;i++) cout<<v[i]<<" ";
            cout<<endl;
            return 0;
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
    while(tc--)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}


Submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
    while(tc--)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        if(tc==1000-80)
        {
            for(int i=0;i<n;i++) cout<<v[i]<<" ";
            cout<<endl;
            return 0;
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
    while(tc--)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        if(tc==1000-80)
        {
            for(int i=0;i<n;i++) cout<<v[i]<<" ";
            cout<<endl;
            return 0;
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}


Submission (verdict: Compilation error):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
     for(int ii=1;i<=tc;ii++)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        if(ii==80)
        {
            for(int i=0;i<n;i++) cout<<v[i]<<" ";
            cout<<endl;
            return 0;
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}
Problem: 2063B - Subsequence Update
Language: C++17 (GCC 7-32)


Submission (verdict: Wrong answer on test 2):
#include<bits/stdc++.h>
using namespace std;

long long int func(int r1,int r2,vector<int>v,vector<int>dummy,long long int sum)
{
    vector<int>temp;
    for(int i=r1-1;i<r2;i++)
    {
        temp.push_back(v[i]);
    }
    sort(temp.begin(),temp.end());
    sort(dummy.begin(),dummy.end());
    int left=temp.size()-1,right=0;
    while (left>=0 && right<dummy.size())
    {
        if(dummy[right]<temp[left])
        {
            sum+=dummy[right];
            sum-=temp[left];
        }
        right++;
        left--;
    }
   // cout<<"d_sum=="<<sum<<endl;
    return sum;


}
int main()
{
    int tc;cin>>tc;
    while(tc--)
    {
        int n,r1,r2;cin>>n>>r1>>r2;
        vector<int>v;
        long long int sum=0;
        for(int i=0;i<n;i++)
        {
            int x;cin>>x;
            v.push_back(x);
            if(i>=r1-1 && i<=r2-1)
            {
                sum+=v[i];
            }
        }
        vector<int>dummy;
         for(int i=0;i<r1-1;i++)
         {
            dummy.push_back(v[i]);
         }

        long long res=func(r1,r2,v,dummy,sum);
         sum=min(sum,res);
         dummy.clear();
        for(int i=r2;i<n;i++)
        {
            dummy.push_back(v[i]);
        }

        res=func(r1,r2,v,dummy,sum);
        sum=min(sum,res);
        cout<<sum<<endl;

    }
}