#include <bits/stdc++.h>
#ifdef LOCAL
    #include "../../Library/DebugTool.cpp"
#endif
using namespace std;
#define ll long long
#define pii pair<int,int>
//const ll MOD = 1000000007;
const ll MOD = 998244353;
ll INF_int = 1e9+11;ll INF_ll = 1e18 + 13;
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define per(i,n) for(int i = n-1;i>=0;i--)
#define mp make_pair
#define All(a) a.begin(),a.end()

void in(){}
template<typename Head,typename ...Tail>void in(Head&& head,Tail&& ...tail){cin >> head;in(std::forward<Tail>(tail)...);}
template<typename T>void vecin(vector<T> &vec){int n = vec.size();rep(i,n) cin >> vec[i];}
void out(){cout << "\n";}
template<typename Head,typename ...Tail>void out(Head&& head,Tail&& ...tail){cout << head << " ";out(std::forward<Tail>(tail)...);}
template<typename T>void vecout(vector<T> a){for(auto x:a)cout << x << " ";cout << endl;}
template<typename T>bool umax(T &x,const T &y){if(x<y){x=y;return true;}return false;}
template<typename T>bool umin(T &x,const T &y){if(x>y){x=y;return true;}return false;}

int main(){
    ll n,m;in(n,m);
    ll t = 1;
    ll tmp = 10;
    while(n>0){
        if(n%2==1){
            t*=tmp;t%=(m*m);
        }
        tmp*=tmp;tmp%=(m*m);
        n/=2;
    }
    out(t/m);
}
#include<bits/stdc++.h>
using namespace std;
#define lli               long long int
#define ulli              unsigned long long int
#define vi                vector<int>
#define ii                pair<int,int>
#define all(v)            v.begin(),v.end()
#define getunique(v)      {v.erase(unique(v.begin(),v.end()),v.end());}
#define pb                push_back
#define ff                first
#define ss                second
#define endl              "\n"
#define fast_io           ios_base::sync_with_stdio(false);cin.tie(NULL)

const int MS=1000001;
const lli INF=1e9+7;

template<typename T>
 bool comp(T a, T b){
  if(a<b)
    return true;
  return false;
 }
 //vector<int> t;
 int n;
 void print(vi v){
  cout<<v.size()<<" ";
  for(int i=0; i<v.size(); i++){
   cout<<v[i]+1<<" ";
  }
  cout<<endl;
 }
int main(){
  //freopen("input.txt", "r", stdin);
  //freopen("output.txt", "w", stdout);
   fast_io;
   cin>>n;
   vector<lli> v(n);
   for(int i=0; i<n; i++)
    cin>>v[i];
  n=min(n,8);
  int mask=(1<<n);
  vector<vector<int> > t(200,vi(0));
  for(int i=0; i<mask; i++){
    lli sum=0;
    vi mine;
    for(int j=0; j<n; j++){
      int her=(1<<j);
      if(her&i)
        sum=(sum+v[j])%200,mine.pb(j);
    }
    if(t[sum].size()>0){
      cout<<"yes"<<endl;
      print(t[sum]);
      print(mine);
      return 0;
    }
    t[sum]=mine;

  }
 cout<<"no";

   
}