using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Math;

class Program
{
    static void Main()
    {
        var s = ReadLine();
        var m = int.Parse(ReadLine());
        var rh = new RollingHash(s);
        var d = new Map<ulong, int>();
        for (int i = 1; i < 11; i++)
        {
            for (int j = 0; j <= s.Length - i; j++)
            {
                d[rh.Hash(j, j+i)]++;
            }
        }
        var a = 0;
        for (int i = 0; i < m; i++)
        {
            var c = ReadLine();
            var h = RollingHash.ComputeHash(c);
            a += d[h];
        }
        WriteLine(a);
    }
}

public class Map<TKey, TValue> : Dictionary<TKey, TValue>
{
    public Map() { }
    public Map(int capacity) : base(capacity) { }
    public Map(IEqualityComparer<TKey> comparer) : base(comparer) { }
    public Map(int capacity, IEqualityComparer<TKey> comparer) : base(capacity, comparer) { }
    public Map(IDictionary<TKey, TValue> dictionary) : base(dictionary) { }
    public Map(IDictionary<TKey, TValue> dictionary, IEqualityComparer<TKey> comparer) : base(dictionary, comparer) { }
    public Map(IEnumerable<KeyValuePair<TKey, TValue>> collection) : base(collection) { }
    public Map(IEnumerable<KeyValuePair<TKey, TValue>> collection, IEqualityComparer<TKey> comparer) : base(collection, comparer) { }

    public new TValue this[TKey key]
    {
        get => TryGetValue(key, out var value) ? value : default;
        set => base[key] = value;
    }
}

public class RollingHash
{
    ulong[] hash;
    ulong[] pow;
    public int Length => hash.Length - 1;
    const ulong @base = 131;
    const ulong mod = (1UL << 61) - 1;

    public RollingHash(string s)
    {
        hash = new ulong[s.Length + 1];
        pow = new ulong[s.Length + 1];
        pow[0] = 1;
        for (int i = 1; i < pow.Length; i++)
        {
            hash[i] = (Mul(hash[i - 1], @base) + s[i - 1]) % mod;
            pow[i] = Mul(pow[i - 1], @base);
        }
    }

    public ulong this[int i]
    {
        get
        {
            return hash[i];
        }
    }

    public ulong Hash(int l, int r)
    {
        var a = hash[r];
        var b = Mul(hash[l], pow[r - l]);
        if (a < b) a += mod;
        return (a - b) % mod;
    }

    public static ulong ComputeHash(string s)
    {
        var h = 0UL;
        foreach (var i in s)
        {
            h = Mul(h, @base) + i;
        }
        return h % mod;
    }

    static ulong Mul(ulong a, ulong b)
    {
        const ulong MASK30 = (1UL << 30) - 1;
        const ulong MASK31 = (1UL << 31) - 1;
        var ah = a >> 31;
        var al = a & MASK31;
        var bh = b >> 31;
        var bl = b & MASK31;
        var m = al * bh + ah * bl;
        var mh = m >> 30;
        var ml = m & MASK30;
        return (ah * bh * 2 + mh + (ml << 31) + al * bl)%mod;
    }
}