#include<bits/stdc++.h>
#include <cstring>
using namespace std;
#define ll  long long
#define endl '\n'
const ll mod = 1000000007;
const double PI = 3.141592653589793238463;
using namespace std;
ll a[101][3],dp[101][100009];
int n,w;
ll f(int item,int wight){
    if (item==n+1)
        return 0;
    if (wight<a[item][1])
        return f(item+1,wight);
    if (dp[item][wight]!=-1)
        return dp[item][wight];
    return dp[item][wight]=max(a[item][2]+f(item+1,wight-a[item][1]),f(item+1,wight));
}
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    string s;
    cin>>s;
    map<char,int>m;
    m[s[0]]++,m[s[1]]++,m[s[2]]++;
    if (m['a']&&m['b']&&m['c'])
        cout<<"YES\n";
    else
        cout<<"NO\n";
    return 0;
}
